Hi all, I am unable to submit solution to this problem. http://mirror.codeforces.com/problemset/problem/1045/I The language is Rust. The page just keeps on reloading.

Cannot submit solutions to problem 2 codeforces round 261

I sat in the gym contest http://mirror.codeforces.com/gym/100228 .Well I am trying to come up with a solution for B)Decorations C)EKG Sequence with no success.Can someone please suggest the algorithm behind these two problems.Seems a lot of u(Over 100 teams) have solved it.Thanks in advance.

Hey suppose given a list of values i need to update a range(add a number to all numbers in that range) and query the number of numbers in that range smaller than 0.Can u suggest an O(log k where k is the length of the range) time complex algorithm for it.I think it's a variation of segment trees but don't know how?