Can anybody explain me the concept of difference array??
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
Can anybody explain me the concept of difference array??
Name |
---|
given an array A[n], its difference array D is some array that satisfies D[i] = A[i] — A[i — 1] (for 1 < i <= N), and D[1] = A[1].
It can be used to perform range update queries of, for instance, adding some value x to all indicies from l to r. you create the difference array, then for each query "l r x", you perform D[l] += x, D[r + 1] -= x, and after all the queries you return to the normal array from it, by performing partial sum (A[1] = D[1], A[i] = A[i — 1] + D[i]) and you're done. Each query was in O(1) instead of O(N).