[线段树]模板1

 1 #include <cstdio>
 2 #define MAXN 200005
 3 #define TREE_SIZE 530000
 4 
 5 struct node {
 6     int sum, min, max;
 7 } t[TREE_SIZE];
 8 
 9 int n, m, a[MAXN];
10 inline int min(int a, int b) {
11     return a < b ? a : b; 
12 }
13 inline int max(int a, int b) {
14     return a > b ? a : b;
15 }
16 inline node join(node a, node b) {
17     node c;
18     c.sum = a.sum +b.sum;
19     c.max = max(a.max, b.max);
20     c.min = min(a.min, b.min);
21     return c;
22 }
23 void build(int l, int r, int k) {
24     if (l == r) {
25         t[k].sum =t [k].min = t[k].max = a[l];
26         return;
27     }
28     int mid = l + r >> 1;
29     build(l, mid, k << 1);
30     build(mid + 1, r, k << 1 | 1);
31     t[k] = join(t[k << 1], t[k << 1 | 1]);
32 }
33 node query(int l, int r, int a, int b, int k) {
34     if(l >= a && r <= b) {
35         return t[k];
36     }
37     int mid = l + r >> 1;
38     if (b <= mid) {
39         return query(l, mid, a, b, k << 1);
40     }
41     if (a > mid) {
42         return query(mid + 1, r, a, b, k << 1 | 1);
43     }
44     return join(query(l, mid, a, b, k << 1), query(mid + 1, r, a, b, k << 1 | 1));
45 }
46 void modify_s(int l, int r, int a, int b, int k) {
47     if (l == a && r == a) {
48         t[k].sum += b;
49         t[k].max = t[k].min = t[k].sum;
50         return;
51     }
52     int mid = l + r >> 1;
53     if (a <= mid) {
54         modify_s(l, mid, a, b, k << 1);
55     }
56     else {
57         modify_s(mid + 1, r, a, b, k << 1 | 1);
58     }
59     t[k] = join(t[k << 1], t[k << 1 | 1]);
60 }
61 int main() {
62     int o, b, c;
63     scanf("%d%d", &n, &m);
64     for(int i = 1; i <= n; ++i) {
65         scanf("%d",a + i);
66     }
67     build(1, n, 1);
68     while (m--) {
69         scanf("%d %d %d", &o, &b, &c);
70         if (o == 1) {
71             modify_s(1, n, b, c, 1); 
72         }
73         if (o == 2) {
74             printf("%d\n", query(1, n, b, c, 1).sum); 
75         }
76         if (o == 3) {
77             printf("%d\n", query(1, n, b, c, 1).max); 
78         }
79         if (o == 4) {
80             printf("%d\n",query(1, n, b, c, 1).min);
81         }
82     }
83     return 0;
84 }