Can anybody explain me the concept of difference array??
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
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).