题意:在一棵树上有两种操作 1:对于点x和点y之间的路径上所有的点的权值+k或者-k,2:单点查权值
思路:树链剖分模板
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#define inf 0x7fffffff
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
typedef long long LL;
const int maxn=50000+10;
int n,m,q;
int siz[maxn],son[maxn],val[maxn],dep[maxn];
int tid[maxn],tid2[maxn],tot;
int fa[maxn],top[maxn];
vector<int> G[maxn];
void dfs1(int u,int father,int d)
{
dep[u]=d;
fa[u]=father;
siz[u]=1;
for (int i=0 ;i<G[u].size() ;i++)
{
int v=G[u][i];
if(v!=father)
{
dfs1(v,u,d+1);
siz[u]+=siz[v];
if(son[u]==-1||siz[v]>siz[son[u]])
son[u]=v;
}
}
}
void dfs2(int u,int tp)
{
top[u]=tp;
tid[u]= ++tot;
tid2[tid[u]]=u;
if (son[u]==-1) return;
dfs2(son[u],tp);
for (int i=0 ;i<G[u].size() ;i++)
{
int v=G[u][i];
if(v!=son[u]&&v!=fa[u])
dfs2(v,v);
}
}
int sum[maxn<<2],col[maxn<<2];
void PushUP(int rt)
{
sum[rt]=max(sum[rt<<1],sum[rt<<1|1]);
}
void PushDown(int rt,int len)
{
if (col[rt]!=0)
{
col[rt<<1] += col[rt];
col[rt<<1|1] += col[rt];
sum[rt<<1] += (len-(len>>1))*col[rt];
sum[rt<<1|1] += (len>>1)*col[rt];
col[rt]=0;
}
}
void build(int l,int r,int rt)
{
col[rt]=0;
if (l==r)
{
sum[rt]=val[tid2[l] ];
return ;
}
int mid=(l+r)>>1;
build(l,mid,rt<<1);
build(mid+1,r,rt<<1|1);
PushUP(rt);
}
void update(int L,int R,int value,int l,int r,int rt)
{
if (L<=l && r<=R)
{
sum[rt] += (r-l+1)*value;
col[rt] += value;
return ;
}
PushDown(rt,(r-l+1));
int mid=(l+r)>>1;
if (L<=mid) update(L,R,value,l,mid,rt<<1);
if (R>mid) update(L,R,value,mid+1,r,rt<<1|1);
PushUP(rt);
}
int query(int l,int r,int rt,int u)
{
if (l==r) return sum[rt];
PushDown(rt,r-l+1);
int mid=(l+r)>>1;
int ans;
if (u<=mid) ans=query(l,mid,rt<<1,u);
else ans=query(mid+1,r,rt<<1|1,u);
PushUP(rt);
return ans;
}
void solve(int u,int v,int value)
{
int f1=top[u],f2=top[v];
while (f1 != f2)
{
if (dep[f1]<dep[f2]) {swap(f1,f2);swap(u,v); }
update(tid[f1],tid[u],value,1,n,1);
u=fa[f1] ;f1=top[u] ;
}
if (dep[u]<dep[v]) swap(u,v);
update(tid[v],tid[u],value,1,n,1);
}
int main()
{
while (scanf("%d%d%d",&n,&m,&q)!=EOF)
{
memset(sum,0,sizeof(sum));
memset(col,0,sizeof(col));
memset(son,-1,sizeof(son));
tot=0;
for (int i=1 ;i<=n ;i++) scanf("%d",&val[i]);
int u,v,value;
char str[3];
for (int i=1 ;i<=n ;i++) G[i].clear();
for (int i=1 ;i<=m ;i++)
{
scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}
dfs1(1,0,0);
dfs2(1,1);
build(1,n,1);
while (q--)
{
scanf("%s",str);
if (str[0]=='Q')
{
scanf("%d",&u);
printf("%d\n",query(1,n,1,tid[u]));
}
else
{
scanf("%d%d%d",&u,&v,&value);
if (str[0]=='D') value=-value;
solve(u,v,value);
}
}
}
return 0;
}