思路:
裸树链剖分+线段树。给出的是点,直接做就好,注意有-值
#pragma comment(linker, "/STACK:102400000,102400000")
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int inf=0x3f3f3f3f;
const int maxn = 30005;
int val_pre[maxn],val[maxn],siz[maxn],son[maxn],id[maxn],fa[maxn],top[maxn],dep[maxn];
int topw;
int M,N,P;
vector <int >vec[maxn];
void dfs1(int u,int f,int d) //第一次搜索建立父子关系,以及节点个数关系
{
siz[u]=1;
fa[u]=f;
dep[u]=d;
son[u]=0;
for(int i=0;i<vec[u].size();i++)
{
int v=vec[u][i];
if(v==fa[u]) continue;
dfs1(v,u,d+1);
siz[u]+=siz[v];
if(siz[son[u]]<siz[v])
son[u]=v;
}
}
void dfs2(int u,int tp) //第二次搜索建立重链,同一条重链的祖先相同,方便之后编号
{
top[u]=tp;
id[u]=++topw;
if(son[u])
dfs2(son[u],tp);
for(int i=0;i<vec[u].size();i++)
{
int v=vec[u][i];
if(v==fa[u]||v==son[u]) continue;
dfs2(v,v);
}
}
//搜索基础上,线段树
struct node
{
int left,right,sum,maxx;
}tree[maxn<<2];
void push_up(int i)
{
tree[i].sum=tree[i<<1].sum+tree[i<<1|1].sum;
tree[i].maxx=max(tree[i<<1].maxx,tree[i<<1|1].maxx);
return ;
}
void build(int i,int left,int right)
{
tree[i].left=left,tree[i].right=right;
tree[i].sum=0;
tree[i].maxx=0;
if(left==right)
{
tree[i].sum=val[left];
tree[i].maxx=val[left];
return ;
}
int mid=(tree[i].left+tree[i].right)>>1;
build(i<<1,left,mid);
build(i<<1|1,mid+1,right);
push_up(i);
}
void update(int i,int aim,int w)
{
if(tree[i].left==aim&&tree[i].right==aim)
{
tree[i].sum=w;
tree[i].maxx=w;
return ;
}
int mid=(tree[i].left+tree[i].right)>>1;
if(aim<=mid)
update(i<<1,aim,w);
else
update(i<<1|1,aim,w);
push_up(i);
}
int ans=0,maxxans=0;
void query(int i,int left,int right)
{
if(tree[i].left==left&&tree[i].right==right)
{
maxxans=max(maxxans,tree[i].maxx);
ans+=tree[i].sum;
return ;
}
int mid=(tree[i].left+tree[i].right)>>1;
if(right<=mid)
query(i<<1,left,right);
else if(left>mid)
query(i<<1|1,left,right);
else
{
query(i<<1,left,mid);
query(i<<1|1,mid+1,right);
}
push_up(i);
}
void findmax(int u,int v)
{
ans=0,maxxans=-inf;
int fu = top[u],fv = top[v];
//swap语句保证深度小的在左侧,大的在右侧
while(fu != fv) //直到同一条重链退出while
{
if(dep[fu] < dep[fv])
{
swap(u,v);
swap(fu,fv);
}
query(1,id[fu],id[u]);
u = fa[fu];
fu = top[u];
}
if(dep[u] > dep[v])
swap(u,v);
query(1,id[u],id[v]);
printf("%d\n",maxxans);
return ;
}
void findsum(int u,int v)
{
ans=0,maxxans=-inf;
int fu = top[u],fv = top[v];
//swap语句保证深度小的在左侧,大的在右侧
while(fu != fv) //直到同一条重链退出while
{
if(dep[fu] < dep[fv])
{
swap(u,v);swap(fu,fv);
}
query(1,id[fu],id[u]);
u = fa[fu];
fu = top[u];
}
if(dep[u] > dep[v])
swap(u,v);
query(1,id[u],id[v]);
printf("%d\n",ans);
return ;
}
int main()
{
while(~scanf("%d",&N))
{
for(int i=0;i<maxn;i++)
vec[i].clear();
int u,v;
for(int i=1 ;i<N;i++)
{
scanf("%d%d",&u,&v);
vec[u].push_back(v);
vec[v].push_back(u);
}
topw = 0;
dfs1(1,0,1);
dfs2(1,1);
for(int i=1;i<=N;i++)
{
scanf("%d",&val_pre[i]);
}
for(int i=1;i<=N;i++)
{
val[id[i]] = val_pre[i];
}
build(1,1,topw );
//debug();
scanf("%d",&P);
char op[10];
int a,b,c;
for(int i=0;i<P;i++)
{
scanf("%s",op);
scanf("%d%d",&a,&b);
if(op[3] == 'N')
{
update(1,id[a],b);
}
else if(op[3] == 'X')
{
findmax(a,b);
}
else if(op[3] == 'M')
{
findsum(a,b);
}
}
}
}