这道题直接用黄学长模版改造过来交了一发。
树链剖分还是很好理解的,先给每个点按照dfs序的顺序编号,然后建好一棵线段树,线段树里面的编号就是每个点被分配的编号。建好之后其实并没有赋值,所以再跑一遍循环把每个点的值赋值进去(线段树的单点修改操作)。此时再开始询问即可logn输出答案。
代码如下:
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
using namespace std;
const int N = 30000 + 5;
const int M = 60000 + 5;
const int INF = 0x7fffffff;
int n, q, tot, sz;
int val[N], dep[N], size[N], fa[N], head[N]; //每个点的价值,深度
//每个点的子树的点的数量,每个点的父亲节点
int pos[N], bl[N]; //dfs序的编号,每个点所在的链的编号
struct seg {
int l, r, mx, sum; //左边界,右边界,最大值,和
}t[100005];
int to[M], next[M];
void add_edge(int u, int v) {
to[tot] = v; next[tot] = head[u]; head[u] = tot++; swap(u, v);
to[tot] = v; next[tot] = head[u]; head[u] = tot++;
}
void dfs1(int u) {
size[u] = 1;
for(int i = head[u]; ~i; i = next[i]) {
int v = to[i];
if(v == fa[u])
continue;
dep[v] = dep[u] + 1;
fa[v] = u;
dfs1(v);
size[u] += size[v];
}
}
void dfs2(int u, int chain) { //chain为最高的祖先的编号
int k = 0;
sz++;
pos[u] = sz; //分配u结点在线段树中的编号
bl[u] = chain; //???
for(int i = head[u]; ~i; i = next[i])
if(dep[to[i]] > dep[u] && size[to[i]] > size[k])
k = to[i]; //选择子树最大的儿子继承重链
if(k == 0)
return;
dfs2(k, chain); //继续走重链
for(int i = head[u]; ~i; i = next[i])
if(dep[to[i]] > dep[u] && k != to[i])
dfs2(to[i], to[i]);//其余儿子新开轻链
}
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 y) {
int sum = 0;
while(bl[x] != bl[y]) {
if(dep[bl[x]] < dep[bl[y]])
swap(x, y);
sum += Querysum(1, pos[bl[x]], pos[x]);
x = fa[bl[x]];
}
if(pos[x] > pos[y])
swap(x, y);
sum += Querysum(1, pos[x], pos[y]);
return sum;
}
int Solvemx(int x, int y) {
int mx = -INF;
while(bl[x] != bl[y]) {
if(dep[bl[x]] < dep[bl[y]])
swap(x, y);
mx = max(mx, Querymx(1, pos[bl[x]], pos[x]));
x = fa[bl[x]];
}
if(pos[x] > pos[y])
swap(x, y);
mx = max(mx, Querymx(1, pos[x], pos[y]));
return mx;
}
void solve() {
build(1, 1, n);
for(int i = 1; i <= n; i++)
Change(1, pos[i], val[i]);
scanf("%d", &q);
char ch[10];
for(int i = 1; i <= q; i++) {
int a, b;
scanf("%s%d%d", ch, &a, &b);
if(ch[0] == 'C') { //改点a的权值为b
val[a] = b;
Change(1, pos[a], b);
} else {
if(ch[1] == 'M')
printf("%d\n", Solvemx(a, b)); //求一条边上的最大值
else
printf("%d\n", Solvesum(a, b)); //求一条边上的和
}
}
}
int main() {
memset(head, -1, sizeof(head));
tot = 0;
scanf("%d", &n);
for(int i = 1; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
add_edge(x, y);
}
for(int i = 1; i <= n; i++)
scanf("%d", &val[i]);
dfs1(1);
dfs2(1, 1);
solve();
return 0;
}