UESTC 1324（分块）

看了UESTC B站视频学习的分块2333
练一练

---

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#define INF 0x3f3f
using namespace std;
const int maxn = 1e5 + 5;
typedef long long LL;
int n,q,num,block;
LL l[maxn], r[maxn], MAX[maxn], belong[maxn] , a[maxn];
void build(){
    num = sqrt(n);
    block = n / num;
    if(n % num) block++;
    for(int i=1; i<=num; i++){
        l[i] = (i-1)*block+1;
        r[i] = i*block;
    }
    r[num] = n;
    for(int i=1; i<=n; i++){
        belong[i] = (i-1)/block+1;
    }
}
void update(int p, int x){
    a[p] += x;
    MAX[belong[p]] = max(MAX[belong[p]], a[p]);
}
LL query(int ql, int qr){
    LL ans = 0;
    if(belong[ql] == belong[qr]){
        for(int i=ql; i<=qr; i++){
            ans = max(ans, a[i]);
        }
        return ans;
    }
    for(int i=ql; i<=r[belong[ql]]; i++){
        ans = max(ans, a[i]);
    }
    for(int i=belong[ql]+1; i<=belong[qr]-1; i++){
        ans = max(ans, MAX[i]);
    }
    for(int i=l[belong[qr]]; i<=qr; i++){
        ans = max(ans, a[i]);
    }
    return ans;
}
int main(){
    while(scanf("%d%d",&n,&q) == 2){
        build();
        memset(a, 0, sizeof(a));
        for(int i=0; i<q; i++){
            int op, u, v;
            scanf("%d%d%d",&op,&u,&v);
            if(op == 1){
                update(u,v);
            }
            else{
                printf("%lld\n",query(u,v));
            }
        }
    }
}