Ttube_lightT's blog

By Ttube_lightT, history, 6 weeks ago, In English

Problem: 296C - Егор и массив Submission using two segment trees: 119576218

Here, the operations are range updates on the given array by some value. So, I thought of segment tree with lazy propagation. The operations are indexed and the operations within a range of indices are repeated, for which I kept another segment tree with lazy propagation.

I couldn't figure out why the solution is getting WA on test 11. Any help is appreciated.

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

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

You don't need to use segment trees. Prefix sum is enough too solve the problem. Look at my submission https://codeforces.com/contest/296/submission/119597052.