Invitation to Byterace 2k20 on CodeChef [Rated for Div-2]

[l_returns]

0 0 0 0 0 0
1 0 0 -1 0 0
This is how we update it
Now, one prefix sum will make it
1 1 1 0 0 0
Second will make it
1 2 3 3 3 3
Now can you see how it helps?
We need to remove last 3 3 3 by one more update on initial array

Now try to connect these pieces. The editorial will be out soon. Then you can read full solution if you are not able to figure it out.

Edit: editorial

AGCY - Editorial

PROBLEM LINK: Practice Author: Vaishakh SM Tester: Smit Mandavia Editorialist: Vaishakh SM DIFFICULTY: Easy PREREQUISITES: Knowledge of prefix sums PROBLEM: Given an array, A of size N initially filled with 0’s, for each query containing two integers L,R add 1 to A[L] , 2 to A[L+1] … R-L+1 to A[R]. In general, add i+1 to A[L+i] for every L\leq i \leq R. QUICK EXPLANATION: In an array initially filled with 0’s, use standard prefix sums to first add 1 to each L,R query, let this array be B…