本人的第二道树链剖分。
题意:n个结点的树,每个结点有个权值,3个操作:1、增加u到v的路径上所有结点的权值;2、减少u到v的路径上所有结点的权值;3、查询某个结点的权值
解题思路:用树链剖分将树形结构转化成线性结构,存在线段树中,每个结点在线段树中有一个新的编号,路径更新,相当于线段树的成段更新,查询相当于线段树的单点查询。
代码如下:
#pragma comment(linker,"/STACK:100000000,100000000")
#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<cstring>
#include<string>
#include<vector>
#define N 50005
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 10e-6
using namespace std;
int a[N];
vector<int> G[N];
int son[N],fa[N],dep[N],siz[N];
void dfs1(int u,int pa,int depth)
{
son[u] = 0;
siz[u] = 1;
dep[u] = depth;
fa[u] = pa;
int len = G[u].size();
for(int i = 0; i < len; i++)
{
int v = G[u][i];
if(v == pa)
continue;
dfs1(v,u,depth+1);
siz[u] += siz[v];
if(siz[v] > siz[ son[u] ])
son[u] = v;
}
}
int dfs_clock,w[N],top[N],b[N];//w[x] = y,x在线段树中的标号为y;b[x] = y 表示线段树中标号为x的结点是x
void dfs2(int u,int pa)
{
w[u] = ++dfs_clock;
top[u] = pa;
if(son[u]) dfs2(son[u],pa);
int len = G[u].size();
for(int i = 0; i < len; i++)
{
int v = G[u][i];
if(v != son[u] && v != fa[u])
dfs2(v,v);
}
}
struct node{
int l,r,val,add;
}tree[N<<2];
void build(int o,int l,int r)
{
tree[o].l = l;
tree[o].r = r;
tree[o].val = 0;
tree[o].add = 0;
if(l == r)
{
tree[o].val = a[ b[l] ];
//tree[o].add = 0;
return;
}
int m = (l+r)/2;
build(2*o,l,m);
build(2*o+1,m+1,r);
}
void output(int o)
{
cout<<o<<" "<<tree[o].l<<" "<<tree[o].r<<" "<<tree[o].val<<endl;
if(tree[o].l == tree[o].r) return ;
output(2*o);
output(2*o+1);
}
void pushdown(int o)
{
if(tree[o].add != 0)
{
tree[2*o].add += tree[o].add;
tree[2*o+1].add += tree[o].add;
tree[o].add = 0;
}
}
void update(int o,int x,int y,int v)
{
if(x <= tree[o].l && tree[o].r <= y)
{
tree[o].add += v;
return;
}
pushdown(o);
int m = (tree[o].l + tree[o].r)/2;
if(x <= m) update(2*o,x,y,v);
if(y > m) update(2*o+1,x,y,v);
}
void change(int x,int y,int v)
{
int f1 = top[x],f2 = top[y];
while(f1 != f2)
{
if(dep[f1] < dep[f2])
{
swap(f1,f2);
swap(x,y);
}
update(1,w[f1], w[x],v);//xiu gai
x = fa[f1];
f1 = top[x];
}
update(1,min(w[x],w[y]), max(w[x],w[y]),v);
if(x == y) return ;
}
int query(int o,int pos,int add)
{
if(tree[o].l == tree[o].r)
return add+tree[o].val+tree[o].add;
int m = (tree[o].l + tree[o].r)/2;
if(pos <= m) return query(2*o,pos,add+tree[o].add);
else return query(2*o+1,pos,add+tree[o].add);
}
int main()
{
int n,m,p;
while(scanf("%d%d%d",&n,&m,&p) != EOF)
{
int i;
for(i = 0; i <= n; i++)
{
G[i].clear();
son[i] = fa[i] = dep[i] = siz[i] = 0;
}
for(i = 1; i <= n; i++) scanf("%d",&a[i]);
for(i = 0; i < m; i++)
{
int u,v;
scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}
dfs1(1,1,1);
dfs_clock = 0;
dfs2(1,1);
for(i = 1; i <= n; i++)
b[ w[i] ] = i;
build(1,1,n);
//output(1);
while(p--)
{
char s[10];
scanf("%s",s);
int x,y,z;
if(s[0] == 'Q')
{
scanf("%d",&x);
printf("%d\n" ,query(1,w[x],0) );
}
else
{
scanf("%d%d%d",&x,&y,&z);
if(s[0] == 'D') z = -z;
change(x,y,z);
}
}
}
return 0;
}
/*
7 6 10
1 2 3 4 5 6 7
1 2
1 3
2 4
2 5
5 6
5 7
*/