考前板
题解:
树链剖分模板题
建树过程O(nlogn)
每次查询经过O(logn)条重链,对于每条重链在线段树上查询复杂度为O(logn);总复杂度为O(mlog^2n)
树链剖分很好的讲解
代码:
最小值要设为负数不要设成0!!!
#include <cstdio>
#include <cstring>
#include <iostream>
#define INF 1e9
using namespace std;
const int N=120005;
int tot,nxt[N*2],point[N],v[N*2],w[N],size[N],a[N],tree[N*4];
int h[N],father[N],maxn[N*4],sum[N*4],son[N],top[N],totw,num[N];
void addline(int x,int y)
{
++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y;
++tot; nxt[tot]=point[y]; point[y]=tot; v[tot]=x;
}
void dfs_1(int now,int fa)
{
father[now]=fa; h[now]=h[fa]+1; size[now]=1;
int maxx=0;
for (int i=point[now];i;i=nxt[i])
if (v[i]!=fa)
{
dfs_1(v[i],now);
size[now]+=size[v[i]];
if (maxx<size[v[i]]){maxx=size[v[i]]; son[now]=v[i];}
}
}
void dfs_2(int now,int fa)
{
if (son[fa]!=now) top[now]=now;
else top[now]=top[fa];
num[now]=++totw;
if (son[now])
{
dfs_2(son[now],now);
for (int i=point[now];i;i=nxt[i])
if (v[i]!=son[now] && v[i]!=fa) dfs_2(v[i],now);
}
}
void updata(int now)
{
maxn[now]=max(maxn[now<<1],maxn[now<<1|1]);
sum[now]=sum[now<<1]+sum[now<<1|1];
}
void build(int now,int l,int r)
{
if (l==r)
{
maxn[now]=a[tree[l]];
sum[now]=a[tree[l]];
return;
}
int mid=(l+r)>>1;
if (l<=mid) build(now<<1,l,mid);
if (r>mid) build(now<<1|1,mid+1,r);
updata(now);
}
void change(int now,int l,int r,int pos,int k)
{
if (l==r) {maxn[now]=k;sum[now]=k;return;}
int mid=(l+r)>>1;
if (pos<=mid) change(now<<1,l,mid,pos,k);
else change(now<<1|1,mid+1,r,pos,k);
updata(now);
}
int qurry(int now,int l,int r,int lrange,int rrange)
{
if (lrange<=l && rrange>=r) return sum[now];
int mid=(l+r)>>1,ans=0;
if (lrange<=mid) ans+=qurry(now<<1,l,mid,lrange,rrange);
if (rrange>mid) ans+=qurry(now<<1|1,mid+1,r,lrange,rrange);
return ans;
}
int qurrym(int now,int l,int r,int lrange,int rrange)
{
if (lrange<=l && rrange>=r) return maxn[now];
int mid=(l+r)>>1,ans=-INF;
if (lrange<=mid) ans=max(ans,qurrym(now<<1,l,mid,lrange,rrange));
if (rrange>mid) ans=max(ans,qurrym(now<<1|1,mid+1,r,lrange,rrange));
return ans;
}
int main()
{
int n,i,Q;
scanf("%d",&n);
for (i=1;i<n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
addline(x,y);
}
for (i=1;i<=n;i++) scanf("%d",&a[i]);
dfs_1(1,0); dfs_2(1,0);
for (i=1;i<=n;i++) tree[num[i]]=i;
build(1,1,n);
scanf("%d",&Q);
while (Q--)
{
char st[10];int x,y;
scanf("%s%d%d",st,&x,&y);
if (st[0]=='C') change(1,1,n,num[x],y);
else if (st[1]=='M')
{
int f1=top[x],f2=top[y],ans=-INF;
while (f1!=f2)
{
if (h[f1]<h[f2]){swap(f1,f2);swap(x,y);}
ans=max(ans,qurrym(1,1,n,num[f1],num[x]));
x=father[f1]; f1=top[x];
}
if (num[x]>num[y]) swap(x,y);
ans=max(ans,qurrym(1,1,n,num[x],num[y]));
printf("%d\n",ans);
}
else
{
int f1=top[x],f2=top[y],ans=0;
while (f1!=f2)
{
if (h[f1]<h[f2]){swap(f1,f2);swap(x,y);}
ans+=qurry(1,1,n,num[f1],num[x]);
x=father[f1]; f1=top[x];
}
if (num[x]>num[y]) swap(x,y);
ans+=qurry(1,1,n,num[x],num[y]);
printf("%d\n",ans);
}
}
}