Can anybody explain me the concept of difference array??
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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).