线段树原码复习

AC（区间最大值，只有单点修改）

# include  <bits/stdc++.h>
using namespace std;
const int N  =2e5+10;
struct Node{
    int l, r;
    int mx;
} tr[N<<2];
void pushup(int u){
    tr[u].mx=max(tr[u<<1].mx,tr[u<<1|1].mx);
}
void build(int u, int l, int r){
    if(l==r)tr[u]={l,r};
    else {
        tr[u]={l,r};
        int mid = l + r >> 1;
        build(u<<1,l,mid);
        build(u<<1|1,mid+1,r);
        pushup(u);
    }
}
int quary(int u, int l, int r){
    if(tr[u].l>=l&&tr[u].r<=r) return tr[u].mx;
    else {
        int mid = tr[u].l+tr[u].r>>1;
        int mx = 0;
        if(l<=mid) mx = quary(u<<1,l,r);
        if(r>mid) mx=max(mx,quary(u<<1|1,l,r));
        return mx;
    }
}
void mody(int u, int x, int c){
    if(tr[u].l==x&&tr[u].r==x) tr[u]={x,x,c};
    else {
        int mid = tr[u].l+tr[u].r>>1;
        if(x<=mid)mody(u<<1,x,c);
        else mody(u<<1|1,x,c);
        pushup(u);
    }
}
int main(){
    int m,p;
    scanf("%d%d", &m, &p);
    build(1,1,m);
    int last=0, n = 0;
    while(m--){
        char op[2];
        int x;
        scanf("%s%d",op,&x);
        if(*op=='A'){
            n++;
            mody(1,n,(x+last)%p);
        }else {
            last = quary(1,n-x+1,n);
            printf("%d\n",last);
            //last = 
        }
    }
    return 0;
}

---

题目描述：

单点修改&&区间最大子段和。

1. 单点修改 pushup

AC(区间子段和)

# include <bits/stdc++.h>
using namespace std;
const int N = 5e5+10;
int w[N];
struct Node {
    int l, r;
    int mx;
    int pre,suf;
    int sum;
} tr[N<<2];
void pushup(Node& u, Node &l, Node &r){
    u.mx=max(l.suf+r.pre, max(l.mx, r.mx) );
    u.pre= max(l.pre, l.sum+r.pre);
    u.suf=max(r.suf,r.sum+l.suf);
    u.sum=l.sum+r.sum;
}
void pushup(int  u){
    pushup(tr[u],tr[u<<1], tr[u<<1|1]);
}
void build(int u, int l, int r){
    if(l==r)tr[u]={r,r,w[r],w[r],w[r],w[r]};
    else {
        tr[u]={l,r};
        int mid = l+r>>1;
        build(u<<1,l,mid);
        build(u<<1|1,mid+1,r);
        pushup(u);
    }
}
void mody(int u, int x, int c){
    if(tr[u].l==x && tr[u].r == x)tr[u]={x,x,c,c,c,c};
    else {
        int mid = tr[u].l+tr[u].r>>1;
        if(x<=mid)mody(u<<1,x,c);
        else mody(u<<1|1,x,c);
        pushup(u);
    }
}
Node quary(int u, int l, int r){
    if(l<=tr[u].l && tr[u].r<=r)return tr[u];
    else {
        int mid =  tr[u].l+tr[u].r>>1;
        Node tree;
        if(r<=mid)tree=quary(u<<1,l,r);
        else if(l>mid)tree=quary(u<<1|1,l,r);
        else {
            auto left = quary(u<<1,l,r);
            auto right = quary(u<<1|1,l,r);
            pushup(tree,left,right);
        }
        return tree;
    }
}
int main(){
    int n, m;
    scanf("%d%d", &n,&m);
    for(int i = 1; i<= n; i ++ )scanf("%d", w+i);
    build(1,1,n);
    while(m--){
        int op;
        int x, y;
        scanf("%d%d%d", &op, &x, &y);
        if(op==1){
            if(x>y)swap(x,y);
            printf("%d\n",quary(1,x,y).mx);
        }else {
            mody(1,x,y);
        }
    }
    return 0;
}

区间最大公约数

题目描述：

1. 在区间增加一个数。
2. 求区间内的最大公约数。

思路：

1. 最大公约数（基于差分）
   $(x,y,y)=(x,y-x,z-y)$
   
   （y总笔记）

2. 做法：
   1）区间修改，可以利用 差分数组 和 上面讲述的 差分gcd性质。
   2）区间查询，基于1），那么对于$[L,R]$的gcd = $gcd(a[l],gcd(b[l+1],..b[R]))$

# include <bits/stdc++.h>
using namespace std;
const int N  = 5e5+10;
typedef long long LL;

LL w[N];
int n, m;
struct Node{
    int l,r;
    LL sum;
    LL d;
} tr[N<<2];

LL gcd(LL a, LL b){return b?gcd(b,a%b):a;}

void pushup(Node&u, Node& l, Node& r){
    u.sum = l.sum + r.sum;
    u.d = gcd(l.d,r.d);
}
void pushup(int u){
    pushup(tr[u],tr[u<<1],tr[u<<1|1]);    
}

void build(int u, int l, int r){
    if(l==r) tr[u]={l,l,w[r]-w[r-1],w[r]-w[r-1]};
    else {
        tr[u]={l,r};
        int mid= l+r>>1;
        build(u<<1,l,mid);
        build(u<<1|1,mid+1,r);
        pushup(u);
    }
}
void mody(int u, int x, LL v){
    if(tr[u].l==x && tr[u].r==x){
        tr[u] = {x,x,tr[u].sum+v,tr[u].d+v};
    }else {
        int mid = tr[u].l+tr[u].r>>1;
        if(x<=mid)mody(u<<1,x,v);
        else mody(u<<1|1,x,v);
        pushup(u);
    }
}
Node quary(int u, int l, int r){
    if(l<=tr[u].l && tr[u].r<=r) return tr[u];
    else {
        int mid = tr[u].l+tr[u].r>>1;
        if(r<=mid) return quary(u<<1,l,r);
        else if(l>mid) return quary(u<<1|1,l,r);
        else {
            auto left = quary(u<<1,l,r);
            auto right = quary(u<<1|1,l,r);
            Node tree;
            pushup(tree,left, right);
            return tree;
        }
    }
}
int main(){
    scanf("%d%d", &n, &m);
    for(int i = 1;i <= n; i ++ )scanf("%lld", w+i);
    build(1,1,n);
    while(m -- ){
        char op[2];
        int l, r;
        LL d;
        scanf("%s%d%d",op, &l, &r);
        if(*op=='Q'){
            auto left = quary(1,1,l);
            auto right = quary(1,l+1,r);
            printf("%lld\n", abs(gcd(left.sum, right.d) ) );
            //数学意义上的gcd为正
        }else {
            scanf("%lld", &d);
            mody(1,l,d);
            if(r+1<=n)mody(1,r+1,-d);
            //差分修改的时候不能超过范围，不然没有意义。
        }
    }
    return 0;
}