Signs alternation#3503
Implement a data structure with elements a_1, a_2, \ldots, a_n that supports the following operations:
assign the value to element a_i;
find the alternating sum on a segment from to inclusive, i.e. (a_l - a_{l+1} + a_{l+2} - \ldots \pm a_r).
The first line contains a positive integer (1 \leq n \leq 10^5) — the length of the array. The second line contains the initial values of the elements — non-negative integers, each not greater than 10^4.
The third line contains a positive integer (1 \leq m \leq 10^5) — the number of operations. The following lines describe the operations:
an operation of the first type is given by three numbers (1 \leq i \leq n,\ 1 \leq j \leq 10^4);
an operation of the second type is given by three numbers (1 \leq l \leq r \leq n).
For each operation of the second type, print the corresponding alternating sum in a separate line.
Example 1