HYSBZ 1036 树的统计Count 树链剖分 点权剖分

题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=1036

1.更改点权值
2.求路径上权值和
3.求路径上最大权值
代码:

#include <bits/stdc++.h>
#define sf scanf
#define pf printf
using namespace std;
const int maxn = 30000 + 500;
int n,m;
typedef long long LL;
const LL INF = 10000000000;
//边集
struct Edge{
    int v,c,pre;
}Es[maxn * 2];
int head[maxn],totEdge;
void INIT_EDGE(){
    memset(head,-1,sizeof head);
    totEdge = 0;
}
void ADD_EDGE(int u,int v,int c){
    Es[totEdge].v = v;
    Es[totEdge].c = c;
    Es[totEdge].pre = head[u];
    head[u] = totEdge++;
}

//树链剖分
int dep[maxn],son[maxn],fa[maxn],size[maxn];
int top[maxn],tid[maxn],rank[maxn];
int SegSize;
int DFS(int rt){
    dep[rt] = dep[fa[rt]] + 1;
    son[rt] = 0;
    size[rt] = 1;
    for(int i = head[rt];~i;i = Es[i].pre){
        int v = Es[i].v;
        if(v != fa[rt]){
            fa[v] = rt;
            size[rt] += DFS(v);
            if(size[son[rt]] < size[v]){
                son[rt] = v;
            }
        }
    }
    return size[rt];
}
void Split(int rt,int tp){
    top[rt] = tp;
    tid[rt] = SegSize++;
    rank[tid[rt]] = rt;
    if(son[rt]){
        Split(son[rt],tp);
        for(int i = head[rt];~i;i = Es[i].pre){
            int v = Es[i].v;
            if(v != fa[rt] && v != son[rt]){
                Split(v,v);
            }
        }
    }
}
void TreeLineSplit(){
    dep[0] = 0;
    fa[1] = 0;
    size[0] = -1;
    DFS(1);
    SegSize = 1;
    Split(1,1);
}

//线段树
#define lson rt << 1 , l , mid
#define rson rt << 1 | 1 , mid + 1 , r
LL MAX[maxn << 2],SUM[maxn << 2];
int num[maxn];
void PushUp(int rt){
    MAX[rt] = max(MAX[rt << 1],MAX[rt << 1 | 1]);
    SUM[rt] = SUM[rt << 1] + SUM[rt << 1 | 1];
}
void BuildTree(int rt,int l,int r){
    if(l == r){
        MAX[rt] = num[l];
        SUM[rt] = num[l];
        return;
    }
    int mid = l + r >> 1;
    BuildTree(lson);BuildTree(rson);
    PushUp(rt);
}
void Update(int rt,int l,int r,int pos,int c){
    if(l == r){
        MAX[rt] = c;
        SUM[rt] = c;
        return;
    }
    int mid = l + r >> 1;
    if(pos <= mid) Update(lson,pos,c);
    else Update(rson,pos,c);
    PushUp(rt);
}
LL QueryMAX(int rt,int l,int r,int L,int R){
    if(L <= l && R >= r) return MAX[rt];
    int mid = l + r >> 1;
    LL ans = -INF;
    if(L <= mid) ans = max(ans ,QueryMAX(lson,L,R));
    if(R > mid) ans = max(ans,QueryMAX(rson,L,R));
    return ans;
}
LL QuerySUM(int rt,int l,int r,int L,int R){
    if(L <= l && R >= r) return SUM[rt];
    int mid = l + r >> 1;
    LL ans = 0;
    if(L <= mid) ans += QuerySUM(lson,L,R);
    if(R > mid) ans += QuerySUM(rson,L,R);
    return ans;
}

int a[maxn];
void GetNumAr(){
    for(int i = 1;i <= n;++i){
        num[tid[i]] = a[i];
    }
}

LL QSUM(int u,int v){
    LL ret = 0;
    while(top[u] != top[v]){
        if(dep[top[v]] < dep[top[u]]) swap(u,v);
        ret += QuerySUM(1,1,n,tid[top[v]],tid[v]);
        v = fa[top[v]];
    }
    if(dep[v] < dep[u]) swap(u,v);
    ret += QuerySUM(1,1,n,tid[u],tid[v]);
    return ret;
}


LL QMAX(int u,int v){
    LL ret = -INF;
    while(top[u] != top[v]){
        if(dep[top[v]] < dep[top[u]]) swap(u,v);
        ret = max(ret,QueryMAX(1,1,n,tid[top[v]],tid[v]));
        v = fa[top[v]];
    }
    if(dep[v] < dep[u]) swap(u,v);
    ret = max(ret,QueryMAX(1,1,n,tid[u],tid[v]));
    return ret;
}
void Change(int x,int c){
    Update(1,1,n,tid[x],c);
}
char op[10];
int main(){
    freopen("rand.txt","r",stdin);
    int x,y;
    while(~sf("%d",&n)){
        INIT_EDGE();
        for(int i = 1;i < n;++i){
            int u,v;sf("%d%d",&u,&v);
            ADD_EDGE(u,v,0);
            ADD_EDGE(v,u,0);
        }
        for(int i = 1;i <= n;++i) sf("%d",&a[i]);
        TreeLineSplit();
        GetNumAr();
        BuildTree(1,1,n);
        sf("%d",&m);
        while(m--){
            sf("%s %d %d",op,&x,&y);
            if(op[1] == 'M'){
                pf("%lld\n",QMAX(x,y));
            }
            else if(op[1] == 'H'){
                Change(x,y);
            }
            else{
                pf("%lld\n",QSUM(x,y));
            }
        }
    }
}

测试数据:

8
1 5
6 2
3 6
1 4
7 8
5 8
1 2
1 2 3 4 5 6 7 8
15
CHANGE 7 -2137
QSUM 4 8
QMAX 5 6
QSUM 8 6
CHANGE 1 -21162
QMAX 7 8
QSUM 6 4
QMAX 1 8
QMAX 8 6
QSUM 8 5
QMAX 1 1
CHANGE 1 -8948
QMAX 2 1
CHANGE 2 -18787
CHANGE 3 -9846