Should the interval tree be balanced? I use simple interval tree and get TL22.

My program on Pascal with simple interval tree gets AC. I don't understand, what problem with C++ may you have???

I think the problem is in that fact that my 'simple interval tree' is not balanced. So in worst case (N=100000,K=2) I got too long tree.

Oh, if you solve it with real tree - of course, it should be balanced! My solution works with interval tree - RSQ, so it is quite fast...

I get TLE 15 with circular linked list; His trees aren't definitely good;