蓝桥-算法训练 ALGO-8 操作格子【线段树 | 单点修改 | 区间求和 | 区间最值】

题目链接

题目描述：

有n个格子，从左到右放成一排，编号为1-n。
共有m次操作，有3种操作类型：
1.修改一个格子的权值，
2.求连续一段格子权值和，
3.求连续一段格子的最大值。
对于每个2、3操作输出你所求出的结果。
1 <= n <= 100000，m <= 100000，0 <= 格子权值 <= 10000。

---

感受：

虽然线段树的题已经非常熟练了，但还是某些地方会写错，要认真写，认真检查！

---

AC Codes：

#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
//#include <unordered_set>
//#include <unordered_map>
#include <deque>
#include <list>
#include <iomanip>
#include <algorithm>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>

using namespace std;
typedef long long ll;
//cout << fixed << setprecision(2);
//cout << setw(2);
const int N = 1e5 + 6, M = 1e9 + 7;

ll sum[N << 2], mx[N << 2];
int n, m, val[N];

void push_up(int x) {
    sum[x] = sum[x << 1] + sum[x << 1 | 1];
    mx[x] = max(mx[x << 1], mx[x << 1 | 1]);
}

void build(int x, int l, int r) {
    if (l == r) {
        sum[x] = mx[x] = val[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(x << 1, l, mid);
    build(x << 1 | 1, mid + 1, r);
    push_up(x);
}

void update(int x, int l, int r, int t, int c) {
    if (l == r) {
        sum[x] = mx[x] = c;
        return;
    }
    int mid = (l + r) >> 1;
    if (t <= mid) {
        update(x << 1, l, mid, t, c);
    } else {
        update(x << 1 | 1, mid + 1, r, t, c);
    }
    push_up(x);
}

ll query_sum(int x, int l, int r, int a, int b) {
    if (a <= l && b >= r) return sum[x];
    int mid = (l + r) >> 1;
    ll res = 0;
    if (a <= mid) res += query_sum(x << 1, l, mid, a, b);
    if (b > mid) res += query_sum(x << 1 | 1, mid + 1, r, a, b);
    return res;
}

int query_max(int x, int l, int r, int a, int b) {
    if (a <= l && b >= r) return mx[x];
    int mid = (l + r) >> 1;
    int res = -1e9;
    if (a <= mid) res = max(res, query_max(x << 1, l, mid, a, b));
    if (b > mid) res = max(res, query_max(x << 1 | 1, mid + 1, r, a , b));
    return res;
}

int main() {
    //freopen("/Users/xumingfei/Desktop/ACM/test.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> val[i];
    build(1, 1, n);
    while (m--) {
        int ch, x, y;
        cin >> ch >> x >> y;
        if (ch == 1) {
            update(1, 1, n, x, y);
        } else if (ch == 2) {
            cout << query_sum(1, 1, n, x, y) << '\n';
        } else {
            cout << query_max(1, 1, n, x, y) << '\n';
        }
    }
    return 0;
}