I am trying to solve the problem Enjoy Sum with Operations from spoj, the problem is based on segment tree. Here is my solution, can anyone help me in gettting AC in this problem.
Can you please look into it.
@vikram91 @rs_710 @purendra_ @hemanth_1 @shraeyas @vidyut_1 @aryanc403 @meooow @alexthelemon @vijju123 @ram_24 @harrypotter0 @pankaj_chopra
guys please help.
Did you try C++? I saw from comments that java solutions got unexpected TLE as well. Aside from that, it looks like ok seg tree+Bitmask to me.
No I didn’t try C++.