Problem link Even after reading the editorial ,I am not getting clear about how we are managing the rotation part recursively. Thanks for the help in advance.
1.DQUERY I know , it can be done using Mo's algorithm , but I need some hints to solve this using segment tree only. I even tried but It gave WA. Mycode
2.ANDROUND — AND Rounds
3.NICEDAY I tried this but again it gave me WA. But I think , my approach was wrong. My code
Thanks a lot in advance.
Problem Mysolution This approach is giving wrong answer. Can you please help me out in this question. My approach is something like:- (=+1; )=-1; Now I am just checking two conditions. 1.Is the overall sum of the segment is 0 or not because a balanced segment like (()) will be (+1+1-1-1)=0. 2.Now to avoid the conditions like )( , (( , I am checking whether the left child node of the 1st node is having sum>=0 and right child sum<=0.If this gets true , then answer is yes else no. Thanks in advance.