题意:
一棵树上有 n n n个节点,编号分别为 1 1 1到 n n n,每个节点都有一个权值 w w w。
我们将以下面的形式来要求你对这棵树完成一些操作:
I. CHANGE u t :把结点u的权值改为t
II. QMAX u v: 询问从点u到点v的路径上的节点的最大权值
III. QSUM u v: 询问从点u到点v的路径上的节点的权值和
分析:
树剖裸题,只不过需要多维护点东西。
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
const int maxn = 3e4 + 5;
const int maxm = 100 + 5;
const int inf = 0x3f3f3f3f;
const LL mod = 1e9 + 7;//19260817
const double pi = acos(-1.0);
int n, x, y, q, cnt, tot, w[maxn], head[maxn];
int id[maxn], pre[maxn], son[maxn], size[maxn], deep[maxn], top[maxn], nw[maxn];
char str[20];
struct node{
int to, next;
}edge[maxn << 1];
struct qwq{
int w, maxw;
}a[maxn << 2];
void pushup(int k){
a[k].maxw = max(a[k << 1].maxw, a[k << 1 | 1].maxw);
a[k].w = a[k << 1].w + a[k << 1 | 1].w;
}
void build(int k, int l, int r){
a[k].maxw = -inf, a[k].w = 0;
if(l == r){
a[k].maxw = a[k].w = nw[l];
return ;
}
int mid = (l + r) >> 1;
build(k << 1, l, mid);
build(k << 1 | 1, mid + 1, r);
pushup(k);
}
void update(int k, int l, int r, int x, int z){
if(l == x && r == x){
a[k].w = a[k].maxw = z;
return ;
}
int mid = (l + r) >> 1;
if(x <= mid) update(k << 1, l, mid, x, z);
if(x > mid) update(k << 1 | 1, mid + 1, r, x, z);
pushup(k);
}
int queryMax(int k, int l, int r, int x, int y){
if(l >= x && r <= y){
return a[k].maxw;
}
int mid = (l + r) >> 1, ans = -inf;
if(x <= mid) ans = max(ans, queryMax(k << 1, l, mid, x, y));
if(y > mid) ans = max(ans, queryMax(k << 1 | 1, mid + 1, r, x, y));
return ans;
}
int querySum(int k, int l, int r, int x, int y){
if(l >= x && r <= y){
return a[k].w;
}
int mid = (l + r) >> 1, ans = 0;
if(x <= mid) ans += querySum(k << 1, l, mid, x, y);
if(y > mid) ans += querySum(k << 1 | 1, mid + 1, r, x, y);
return ans;
}
void addedge(int u, int v){
edge[++cnt].to = v;
edge[cnt].next = head[u];
head[u] = cnt;
}
void dfs1(int x, int f, int d){
pre[x] = f;
deep[x] = d;
size[x] = 1;
int MAX = -1;
for(int i = head[x]; i; i = edge[i].next){
int v = edge[i].to;
if(v == f) continue;
dfs1(v, x, d + 1);
size[x] += size[v];
if(size[v] > MAX) MAX = size[v], son[x] = v;
}
}
void dfs2(int x, int topf){
id[x] = ++tot;
nw[tot] = w[x];
top[x] = topf;
if(!son[x]) return ;
dfs2(son[x], topf);
for(int i = head[x]; i; i = edge[i].next){
int v = edge[i].to;
if(v == pre[x] || v == son[x]) continue;
dfs2(v, v);
}
}
int queryMax(int x, int y){
int ans = -inf;
while(top[x] != top[y]){
if(deep[top[x]] < deep[top[y]]) swap(x, y);
ans = max(ans, queryMax(1, 1, n, id[top[x]], id[x]));
x = pre[top[x]];
}
if(deep[x] > deep[y]) swap(x, y);
ans = max(ans, queryMax(1, 1, n, id[x], id[y]));
return ans;
}
int querySum(int x, int y){
int ans = 0;
while(top[x] != top[y]){
if(deep[top[x]] < deep[top[y]]) swap(x, y);
ans += querySum(1, 1, n, id[top[x]], id[x]);
x = pre[top[x]];
}
if(deep[x] > deep[y]) swap(x, y);
ans += querySum(1, 1, n, id[x], id[y]);
return ans;
}
int main(){
scanf("%d", &n);
for(int i = 1; i <= n - 1; i++){
scanf("%d %d", &x, &y);
addedge(x, y), addedge(y, x);
}
for(int i = 1; i <= n; i++) scanf("%d", w + i);
dfs1(1, -1, 1);
dfs2(1, 1);
build(1, 1, n);
scanf("%d", &q);
while(q--){
scanf("%s %d %d", str, &x, &y);
if(str[0] == 'C'){
update(1, 1, n, id[x], y);
}else if(strcmp(str, "QSUM") == 0){
printf("%d\n", querySum(x, y));
}else if(strcmp(str, "QMAX") == 0){
printf("%d\n", queryMax(x, y));
}
}
return 0;
}