Description
Input
Output
Sample Input
4
1 2
2 3
4 1
4 2 1 3
12
QMAX 3 4
QMAX 3 3
QMAX 3 2
QMAX 2 3
QSUM 3 4
QSUM 2 1
CHANGE 1 5
QMAX 3 4
CHANGE 3 6
QMAX 3 4
QMAX 2 4
QSUM 3 4
1 2
2 3
4 1
4 2 1 3
12
QMAX 3 4
QMAX 3 3
QMAX 3 2
QMAX 2 3
QSUM 3 4
QSUM 2 1
CHANGE 1 5
QMAX 3 4
CHANGE 3 6
QMAX 3 4
QMAX 2 4
QSUM 3 4
Sample Output
4
1
2
2
10
6
5
6
5
16
1
2
2
10
6
5
6
5
16
题解
#include<iostream>
#include<cstdio>
#include<cstring>
#define inf 0x7fffffff
#define N 30005
#define M 60005
using namespace std;
int n,q,cnt,sz;
int fa[N][15],v[N],deep[N],size[N],head[N];
int pos[N],belong[N];
bool vis[N];
struct data
{
int to,next;
} e[M];
struct seg
{
int l,r,mx,sum;
} t[100005];
void insert(int u,int v)
{
e[++cnt].to=v;
e[cnt].next=head[u];
head[u]=cnt;
e[++cnt].to=u;
e[cnt].next=head[v];
head[v]=cnt;
}
void init()
{
scanf("%d",&n);
for(int i=1; i<n; i++)
{
int x,y;
scanf("%d%d",&x,&y);
insert(x,y);
}
for(int i=1; i<=n; i++)
scanf("%d",&v[i]);
}
void dfs1(int x)
{
size[x]=1;
vis[x]=1;
for(int i=1; i<=14; i++)
{
if(deep[x]<(1<<i))break;
fa[x][i]=fa[fa[x][i-1]][i-1];//倍增处理祖先信息
}
for(int i=head[x]; i; i=e[i].next)
{
if(vis[e[i].to])continue;
deep[e[i].to]=deep[x]+1;
fa[e[i].to][0]=x;
dfs1(e[i].to);
size[x]+=size[e[i].to];
}
}
void dfs2(int x,int chain)
{
int k=0;
sz++;
pos[x]=sz;//分配x结点在线段树中的编号
belong[x]=chain;
for(int i=head[x]; i; i=e[i].next)
if(deep[e[i].to]>deep[x]&&size[e[i].to]>size[k])
k=e[i].to;//选择子树最大的儿子继承重链
if(k==0)return;
dfs2(k,chain);
for(int i=head[x]; i; i=e[i].next)
if(deep[e[i].to]>deep[x]&&k!=e[i].to)
dfs2(e[i].to,e[i].to);//其余儿子新开重链
}
int lca(int x,int y)//求lca
{
if(deep[x]<deep[y])swap(x,y);
int t=deep[x]-deep[y];
for(int i=0; i<=14; i++)
if(t&(1<<i))x=fa[x][i];
for(int i=14; i>=0; i--)
if(fa[x][i]!=fa[y][i])
{
x=fa[x][i];
y=fa[y][i];
}
if(x==y)return x;
else return fa[x][0];
}
void build(int k,int l,int r)//建线段树
{
t[k].l=l;
t[k].r=r;
if(l==r)return;
int mid=(l+r)>>1;
build(k<<1,l,mid);
build(k<<1|1,mid+1,r);
}
void change(int k,int x,int y)//线段树单点修改
{
int l=t[k].l,r=t[k].r,mid=(l+r)>>1;
if(l==r)
{
t[k].sum=t[k].mx=y;
return;
}
if(x<=mid)change(k<<1,x,y);
else change(k<<1|1,x,y);
t[k].sum=t[k<<1].sum+t[k<<1|1].sum;
t[k].mx=max(t[k<<1].mx,t[k<<1|1].mx);
}
int querysum(int k,int x,int y)//线段树区间求和
{
int l=t[k].l,r=t[k].r,mid=(l+r)>>1;
if(l==x&&y==r)return t[k].sum;
if(y<=mid)return querysum(k<<1,x,y);
else if(x>mid)return querysum(k<<1|1,x,y);
else
{
return querysum(k<<1,x,mid)+querysum(k<<1|1,mid+1,y);
}
}
int querymx(int k,int x,int y)//线段树区间求最大值
{
int l=t[k].l,r=t[k].r,mid=(l+r)>>1;
if(l==x&&y==r)return t[k].mx;
if(y<=mid)return querymx(k<<1,x,y);
else if(x>mid)return querymx(k<<1|1,x,y);
else
{
return max(querymx(k<<1,x,mid),querymx(k<<1|1,mid+1,y));
}
}
int solvesum(int x,int f)
{
int sum=0;
while(belong[x]!=belong[f])//不在一条重链上就将x跳到链首,走一条轻边,如此反复
{
sum+=querysum(1,pos[belong[x]],pos[x]);
x=fa[belong[x]][0];
}
sum+=querysum(1,pos[f],pos[x]);
return sum;
}
int solvemx(int x,int f)
{
int mx=-inf;
while(belong[x]!=belong[f])
{
mx=max(mx,querymx(1,pos[belong[x]],pos[x]));
x=fa[belong[x]][0];
}
mx=max(mx,querymx(1,pos[f],pos[x]));
return mx;
}
void solve()
{
build(1,1,n);
for(int i=1; i<=n; i++)
change(1,pos[i],v[i]);
scanf("%d",&q);
char ch[6];
for(int i=1; i<=q; i++)
{
int x,y;
scanf("%s%d%d",ch,&x,&y);
if(ch[0]=='C')
{
v[x]=y;
change(1,pos[x],y);
}
else
{
int t=lca(x,y);
if(ch[1]=='M')
printf("%d\n",max(solvemx(x,t),solvemx(y,t)));
else
printf("%d\n",solvesum(x,t)+solvesum(y,t)-v[t]);
}
}
}
int main()
{
init();
dfs1(1);
dfs2(1,1);
solve();
return 0;
}
#include<set>
#include<map>
#include<ctime>
#include<queue>
#include<cmath>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<iostream>
#include<algorithm>
#define inf 1000000000
#define ll long long
using namespace std;
int read()
{
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*10+ch-'0';ch=getchar();}
return x*f;
}
int n,m,top;
int fa[30005],c[30005][2],u[30005],v[30005],q[30005];
ll w[30005],sum[30005],mx[30005];
bool rev[30005];
bool isroot(int x)
{
return c[fa[x]][0]!=x&&c[fa[x]][1]!=x;
}
void update(int x)
{
int l=c[x][0],r=c[x][1];
sum[x]=sum[l]+sum[r]+w[x];
mx[x]=max(w[x],max(mx[l],mx[r]));
}
void pushdown(int x)
{
int l=c[x][0],r=c[x][1];
if(rev[x])
{
rev[x]^=1;rev[l]^=1;rev[r]^=1;
swap(c[x][0],c[x][1]);
}
}
void rotate(int x)
{
int y=fa[x],z=fa[y],l,r;
l=(c[y][1]==x);r=l^1;
if(!isroot(y))c[z][c[z][1]==y]=x;
fa[c[x][r]]=y;fa[y]=x;fa[x]=z;
c[y][l]=c[x][r];c[x][r]=y;
update(y);update(x);
}
void splay(int x)
{
q[++top]=x;
for(int i=x;!isroot(i);i=fa[i])
q[++top]=fa[i];
while(top)pushdown(q[top--]);
while(!isroot(x))
{
int y=fa[x],z=fa[y];
if(!isroot(y))
{
if(c[y][0]==x^c[z][0]==y)rotate(x);
else rotate(y);
}
rotate(x);
}
}
void access(int x)
{
for(int t=0;x;t=x,x=fa[x])
splay(x),c[x][1]=t,update(x);
}
void makeroot(int x)
{
access(x);splay(x);rev[x]^=1;
}
void link(int x,int y)
{
makeroot(x);fa[x]=y;
}
void split(int x,int y)
{
makeroot(x);access(y);splay(y);
}
int main()
{
n=read();mx[0]=-inf;
for(int i=1;i<n;i++)
u[i]=read(),v[i]=read();
for(int i=1;i<=n;i++)
{
w[i]=read();
sum[i]=mx[i]=w[i];
}
for(int i=1;i<n;i++)
link(u[i],v[i]);
m=read();
char ch[10];
int u,v;
while(m--)
{
scanf("%s",ch);
u=read();v=read();
if(ch[1]=='H')
{
splay(u);
w[u]=v;
update(u);
}
if(ch[1]=='M')
split(u,v),printf("%lld\n",mx[v]);
if(ch[1]=='S')
split(u,v),printf("%lld\n",sum[v]);
}
return 0;
}