ABC014C
https://gyazo.com/bcea3a19aa82653da975c281ab5f0e67
Thoughts.
The answer can be obtained by sorting pairs of starting point and +1, and ending point and -1, and accumulating them from the beginning and taking the maximum value.
Even if they're covered by the same value, the -1 comes first, so no fraudulently large value is created.
200,000 O(NlogN), so I think you'll be fine.
Hmmm, it still looks like you can afford it.
Official Explanation
Officials use the 1000000 sequence, but yikes.
---
This page is auto-translated from /nishio/ABC014C. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.