题意:
http://poj.org/problem?id=3237
给一棵树,操作三种
CHANGE i v | Change the weight of the ith edge to v |
NEGATE a b | Negate the weight of every edge on the path from a to b |
QUERY a b | Find the maximum weight of edges on the path from a to b |
树链剖分模版题,先把树上的结点根据重链轻链分解成一个个连续的区间,把每个节点的编号映射到 一个数组p[]
对于查询(a,b)的操作,则从a,b出发,不断查询区间【a,top(a)】的某些值,然后a指向fa(top[a]),直到a,b的top一样,也即在同一条链上,在进行最后一次查询。
这里线段树阶段x记录的是x到fa(x)的边的边权。
所以change和query操作都变成在线段树的操作了,而negate则直接交换区间最大最小值即可。
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
const int MAXN = 100010;
struct Edge
{
int to,next;
} edge[MAXN*2];
int head[MAXN],tot;
int top[MAXN];//top[v]表示v所在的重链的顶端节点
int fa[MAXN]; //父亲节点
int deep[MAXN];//深度
int num[MAXN];//num[v]表示以v为根的子树的节点数
int p[MAXN];//p[v]表示v与其父亲节点的连边在线段树中的位置
int fp[MAXN];//和p数组相反
int son[MAXN];//重儿子
int pos;
void init()
{
tot = 0;
memset(head,-1,sizeof(head));
pos = 0;
memset(son,-1,sizeof(son));
}
void addedge(int u,int v)
{
edge[tot].to = v;
edge[tot].next = head[u];
head[u] = tot++;
}
void dfs1(int u,int pre,int d) //第一遍dfs求出fa,deep,num,son
{
deep[u] = d;
fa[u] = pre;
num[u] = 1;
for(int i = head[u]; i != -1; i = edge[i].next)
{
int v = edge[i].to;
if(v != pre)
{
dfs1(v,u,d+1);
num[u] += num[v];
if(son[u] == -1 || num[v] > num[son[u]])
son[u] = v;
}
}
}
void getpos(int u,int sp) //第二遍dfs求出top和p
{
top[u] = sp;
p[u] = ++pos;
fp[p[u]] = u;
if(son[u] == -1) return;
getpos(son[u],sp);
for(int i = head[u] ; i != -1; i = edge[i].next)
{
int v = edge[i].to;
if(v != son[u] && v != fa[u])
getpos(v,v);
}
}
struct TREE
{
int maxx[4*MAXN],minn[4*MAXN],ne[4*MAXN] ;
void build(int l,int r,int i) // 线段树的建立;
{
ne[i]=0; //ne[rt]=aa[++ok];
maxx[i]=minn[i]=0;
if(l==r) return;
int mid=(l+r)>>1;
build(l,mid,i<<1);
build(mid+1,r,i<<1|1);
}
void pushDown(int i, int l, int r) //把i节点的延迟标记传递到左右儿子节点
{
if(ne[i] != 0)
{
int mid = (l + r) >> 1;
maxx[i << 1] = -maxx[i << 1];
minn[i << 1] = -minn[i << 1];
swap(minn[i << 1],maxx[i << 1]);
maxx[i << 1|1] = -maxx[i << 1|1];
minn[i << 1|1] = -minn[i << 1|1];
swap(minn[i << 1|1],maxx[i << 1|1]);
ne[i << 1] ^= 1;
ne[i << 1 | 1]^= 1;
ne[i] = 0;
}
}
void update_ne(int i,int l,int r,int ql,int qr)
{
if(l > qr ||ql > r) //更新区间不在当前区间内
return ;
if(l >=ql && r <=qr ) //要更新的区间把当前区间完全包括,则把当前整个区间+val,然后返回上一层
{
maxx[i] = -maxx[i];
minn[i] = -minn[i];
swap(maxx[i],minn[i]);
ne[i]^=1;
return ;
}
pushDown(i, l, r); //如果上面没reutrn 表示要往左右儿子区间查询,所以把延迟标记放下去
int mid = (l + r) >> 1;
update_ne(i << 1, l, mid, ql, qr);
update_ne(i << 1 | 1, mid + 1, r, ql, qr);
maxx[i] = max(maxx[i << 1] , maxx[i << 1 | 1]);
minn[i] = min(minn[i << 1] , minn[i << 1 | 1]);
}
void update(int i, int l, int r, int x, int val) //更新区间为qlqr,当前区间为l,r,代表当前区间和的节点为i,更新值为val,
{
if(l > x ||x > r) //更新区间不在当前区间内
return ;
if(l ==x && r ==x ) //要更新的区间把当前区间完全包括,则把当前整个区间+val,然后返回上一层
{
maxx[i] = val;
minn[i] = val;
ne[i]=0;
return ;
}
pushDown(i, l, r); //如果上面没reutrn 表示要往左右儿子区间查询,所以把延迟标记放下去
int mid = (l + r) >> 1;
update(i << 1, l, mid, x, val);
update(i << 1 | 1, mid + 1, r, x, val);
maxx[i] = max(maxx[i << 1] , maxx[i << 1 | 1]);
minn[i] = min(minn[i << 1] , minn[i << 1 | 1]);
}
int query(int i, int l, int r, int ql, int qr) //查询区间为qlqr,当前区间为l,r,代表当前区间和的节点为i
{
if(l > qr || ql > r)
return -2e9;
if(l >= ql && r <= qr)
return maxx[i];
pushDown(i, l, r); //同update
int mid =( l + r) >> 1;
return max(query(i << 1, l, mid, ql, qr)
,query(i << 1 | 1, mid + 1, r, ql, qr));
}
int findmax(int u,int v)//查询u->v链的最大值
{
int f1=top[u],f2=top[v];
int tmp=-1e9;
while(f1!=f2)
{
if (deep[f1]<deep[f2])
{
swap(f1,f2);
swap(u,v);
}
tmp=max(tmp,query(1,1,pos,p[f1],p[u]));
u=fa[f1],f1=top[u];
}
if (u==v) return tmp;
if (deep[u]>deep[v] ) swap(u,v);
return max(tmp, query(1,1,pos,p[son[u]],p[v])); //son[u]是u到fu的边权
}
void Negate(int u,int v)
{
int f1=top[u],f2=top[v];
while(f1!=f2)
{
if (deep[f1]<deep[f2])
{
swap(f1,f2);
swap(u,v);
}
update_ne(1,1,pos,p[f1],p[u]);
u=fa[f1],f1=top[u];
}
if (u==v) return ;
if (deep[u]>deep[v])swap(u,v);
return update_ne(1,1,pos,p[son[u]],p[v]);
}
};
TREE tp;
int e[MAXN][3];
int main()
{
int n;
int t;
cin>>t;
while(t--)
{
init();
scanf("%d",&n);
for (int i=0; i<n-1; i++)
{
scanf("%d%d%d",&e[i][0],&e[i][1],&e[i][2]);
addedge(e[i][0],e[i][1]);
addedge(e[i][1],e[i][0]);
}
dfs1(1,0,0);
getpos(1,1);
tp.build(1,pos,1);
// build(1,1,pos);
for (int i=0; i<n-1; i++)
{
if (deep[e[i][0]]>deep[e[i][1]])
swap(e[i][0],e[i][1]);
tp.update(1,1,pos,p[e[i][1]],e[i][2]); //son->fa的边权为e[i][2]
}
char op[10];
int u,v;
while(scanf("%s",op))
{
if (op[0]=='D') break;
scanf("%d%d",&u,&v);
if (op[0]=='Q')
printf("%d\n",tp.findmax(u,v));
else if (op[0]=='C')
tp.update(1,1,pos,p[e[u-1][1]],v);
else tp.Negate(u,v);
}
}
return 0;
}
CHANGE i v | Change the weight of the ith edge to v |
NEGATE a b | Negate the weight of every edge on the path from a to b |
QUERY a b | Find the maximum weight of edges on the path from a to b |
Input