【UESTC 1324】卿学姐与公主【分块】_与学姐分在一块-CSDN博客

本文链接：https://blog.csdn.net/guhaiteng/article/details/64926174

传送门：

思路：

这里用分块做的，练练分块。当然这题线段树也可以做。

代码：

#include <set>
#include <map>
#include <queue>
#include <vector>
#include <math.h>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
using  namespace  std;

#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define ull unsigned long long
#define mst(ss,b) memset(ss,b,sizeof(ss));
#define pl(x) cout << #x << "= " << x << endl;
const int inf = 0x3f3f3f3f;
const int N = 1e5+5;

int n;
int num, blocks, belong[N], l[N], r[N];
//num分块的个数
//belong[i]表示i属于哪一块
//blocks表示块的大小
//l[i]表示i这个块的左端点位置
//r[i]表示右端点的位置

ll a[N], Max[N];


void build(){
    blocks = sqrt(n);
    num = n/blocks; if(n%blocks)num++;
    for(int i=1; i<=num; i++)  
        l[i] = (i-1)*blocks+1, r[i] = i*blocks;
    r[num] = n;
    for(int i=1; i<=n; i++)
        belong[i] = (i-1)/blocks+1;

    for(int i=1; i<=num; i++)
        for(int j=l[i]; j<=r[i]; j++)
            Max[i] = max(Max[i], a[j]);
}

void update(int x, int y){
    a[x] += y;
    Max[belong[x]] = max(Max[belong[x]], a[x]);

}

ll query(int x, int y){
    ll ans = 0;
    if(belong[x] == belong[y]){ //属于同一块的情况特殊处理
        for(int i=x; i<=y; i++)
            ans = max(ans, a[i]);
        return ans;
    }
    for(int i=x; i<=r[belong[x]]; i++)ans = max(ans, a[i]);
    for(int i=l[belong[y]]; i<=y; i++)ans = max(ans, a[i]);
    for(int i=belong[x]+1; i<belong[y]; i++)ans = max(ans, Max[i]);
    return ans;
}

int  main(){
    int q;
    scanf("%d%d", &n,&q);
    build();
    while(q--){
        int op, x, y;
        scanf("%d%d%d", &op, &x, &y);
        if(op == 1)update(x, y);
        else printf("%lld\n", query(x, y));
    }
    return 0;
}