【树链剖分】洛谷[P2590·树的统计]

洛谷[P2590·树的统计]

---

传送门

题目大意
给定一棵树，实现以下操作：

1. 修改一个点的权
2. 求一条路径上的点权和
3. 求一条路径上的点权最大值

---

解法
裸的树剖，注意下细节吧，很久没写了回来练一练手=-=

---

#include<bits/stdc++.h>
#define lc root<<1
#define rc root<<1|1
#define INF 0x7fffffff
#define maxn 30010
#define read(x) x=fasr()
using namespace std;
struct Tree
{
    int left,right,sum,val;
}tree[maxn<<4];
struct Edge
{
    int v,next;
}edge[maxn<<1];
int head[maxn],a[maxn],top[maxn],link[maxn],deep[maxn],size[maxn],heavy[maxn],father[maxn],num[maxn];
int n,cnt=0,tot=0;
inline int max(int x,int y){return x>y?x:y;}
inline void pushup(int root)
{
    tree[root].sum=tree[lc].sum+tree[rc].sum;
    tree[root].val=max(tree[lc].val,tree[rc].val);
}
inline void build(int root,int l,int r)
{
    tree[root].left=l;tree[root].right=r;
    if (l==r) {tree[root].sum=tree[root].val=a[link[l]];return;}
    int mid=(l+r)>>1;
    build(lc,l,mid);build(rc,mid+1,r);
    pushup(root);
}
inline void update(int root,int p,int delta)
{
    if (tree[root].left==tree[root].right){tree[root].sum=tree[root].val=delta;return;}
    int mid=(tree[root].left+tree[root].right)>>1;
    if (p<=mid) update(lc,p,delta);else update(rc,p,delta);
    pushup(root);
}
inline int query_sum(int root,int l,int r)
{
    if (tree[root].left>=l && tree[root].right<=r) return tree[root].sum;
    pushup(root);
    int mid=(tree[root].left+tree[root].right)>>1,ans=0;
    if (l<=mid) ans+=query_sum(lc,l,r);
    if (r>mid)  ans+=query_sum(rc,l,r);
    return ans;
}
inline int query_max(int root,int l,int r)
{
    if (tree[root].left>=l && tree[root].right<=r) return tree[root].val;
    pushup(root);
    int mid=(tree[root].left+tree[root].right)>>1,ans=-INF;
    if (l<=mid) ans=max(ans,query_max(lc,l,r));
    if (r>mid)  ans=max(ans,query_max(rc,l,r));
    return ans;
}
inline void addEdge(int from,int to)
{
    edge[++cnt]=(Edge){to,head[from]};
    head[from]=cnt;
}
inline void dfs(int u,int fa)
{
    father[u]=fa;size[u]=1;deep[u]=deep[fa]+1;
    for (int i=head[u];i;i=edge[i].next)
    {
        int v=edge[i].v;
        if (v==fa) continue;
        dfs(v,u);size[u]+=size[v];
        if (heavy[u]==0 || size[heavy[u]]<size[v]) heavy[u]=v;
    }
}
inline void dfs_(int u,int ut)
{
    top[u]=ut;num[u]=++tot;link[tot]=u;
    if (!heavy[u]) return;
    dfs_(heavy[u],ut);
    for (int i=head[u];i;i=edge[i].next)
    {
        int v=edge[i].v;
        if (v!=heavy[u] && v!=father[u]) dfs_(v,v);
    }
}
inline int getsum(int l,int r)
{
    int ans=0;
    while (top[l]!=top[r])
    {
        if (deep[top[l]]<deep[top[r]]) swap(l,r);
        ans=ans+query_sum(1,num[top[l]],num[l]);
        l=father[top[l]];
    }
    if (deep[l]>deep[r]) swap(l,r);
    ans+=query_sum(1,num[l],num[r]);
    return ans;
}
inline int getmax(int l,int r)
{
    int ans=-INF;
    while (top[l]!=top[r])
    {
        if (deep[top[l]]<deep[top[r]]) swap(l,r);
        ans=max(ans,query_max(1,num[top[l]],num[l]));
        l=father[top[l]];
    }
    if (deep[l]>deep[r]) swap(l,r);
    ans=max(ans,query_max(1,num[l],num[r]));
    return ans;
}
inline int fasr()
{
    int x=0,f=1;char ch=getchar();
    while (ch<'0' || ch>'9') {if (ch=='-') f=-1;ch=getchar();}
    while (ch>='0' && ch<='9') {x=(x<<3)+(x<<1)+ch-48;ch=getchar();}
    return x*f;
}
inline void init()
{
    read(n);
    for (int i=1;i<n;i++)
    {
        int x,y;
        read(x);read(y);
        addEdge(x,y);addEdge(y,x);
    }
    for (int i=1;i<=n;i++) read(a[i]);
}
inline void solve()
{
    int q,l,r;string str;
    read(q);
    while (q--)
    {
        cin>>str;read(l);read(r);
        if (str=="CHANGE") update(1,num[l],r);
        else if (str=="QMAX") printf("%d\n",getmax(l,r));
        else if (str=="QSUM") printf("%d\n",getsum(l,r));
    }
}
int main()
{
    init();
    dfs(1,0);
    dfs_(1,1);
    build(1,1,n);
    solve();
    return 0;
}

备注：

1. 线段树写的很丑，有什么毛病的地方欢迎大佬纠正！
2. 粘代码片的时候可能会有些格式看起来很奇怪
3. BCY我老婆可好看了