mohit_joshi's blog

Need help in BRCKTS — Brackets(SPOJ)

By mohit_joshi, history, 3 years ago, In English

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.

  • Vote: I like it
  • +3
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

For this case it says YES because the code says node[2] >= 0 and node[3] <= 0, but the sum goes negative in the second half at index 5

6
(()))(
1
0
→ Reply