1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49

template<typename T> struct seg_tree {
	T seg[4*MX], tmp[4*MX];
	inline T pull(const T & a, const T & b) { return a+b; }
	inline void push(int l, int r, int n) {
		seg[n] += (r-l+1)*tmp[n];
		if (l != r) tmp[n<<1] += tmp[n], tmp[n<<1|1] += tmp[n];
		tmp[n] = 0;
	}
	void build(T v, int l = 0, int r = -1, int n = 1) {
		if (r == -1) r = N-1;
		if (l == r) seg[n] = v;
		else {
			int m = (l+r)>>1;
			build(l, m, n<<1), build(m+1, r, n<<1|1);
			seg[n] = pull(seg[n<<1], seg[n<<1|1]);
		}
	}
	void update(int x, T v, int l = 0, int r = -1, int n = 1) {
		if (r == -1) r = N-1;
		if (l == r) seg[n] += v;
		else {
			int m = (l+r)>>1;
			x <= m ? update(x, v, l, m, n<<1) : update(x, v, m+1, r, n<<1|1);
			seg[n] = pull(seg[n<<1], seg[n<<1|1]);
		}
	}
	void update(int a, int b, T v, int l = 0, int r = -1, int n = 1) {
		if (r == -1) r = N-1;
		push(l, r, n);
		if (l > r || l > b || r < a) return;
		if (l >= a && r <= b) {
			tmp[n] += v;
			push(l, r, n);
		}
		else {
			int m = (l+r)>>1;
			update(a, b, v, l, m, n<<1), update(a, b, v, m+1, r, n<<1|1);
			seg[n] = pull(seg[n<<1], seg[n<<1|1]);
		}
	}
	T query(int a, int b, int l = 0, int r = -1, int n = 1) {
		if (r == -1) r = N - 1;
		if (a > b || l > b || r < a) return 0;
		push(l, r, n);
		if (l >= a && r <= b) return seg[n];
		int m = (l+r)>>1;
		return pull(query(a, b, l, m, n<<1), query(a, b, m+1, r, n<<1|1));
	}
};