题意:给你一颗树,多次操作,操作一: 给两个数x , k,让以x为根节点的子树(包括它自己) 中所有节点值 + k ; 操作二: 给一个数x, 问以x为根节点的子树(包括它自己) 中所有节点值的最大值。最开始所有节点值为0;
分析: 我们可以把树上问题转换为序列问题, 跑一遍dfs得到dfs序, in[], out[], 然后可以得到每个节点x为根节点的子树在dfs序中的范围 in[x] ~ out[x]. 然后问题就转换为线段树区间修改,区间查询最值。
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N = 2e5 + 10;
int n;
struct Node{
int l, r, maxx, add;
}tr[N << 2];
int a[N], din[N], seq[N], idx, in[N], out[N];
vector<int>G[N];
void pushup(int u)
{
tr[u].maxx = max(tr[u << 1].maxx, tr[u << 1 | 1].maxx);
}
void pushdown(int u)
{
auto &root = tr[u], &left = tr[u << 1], &right = tr[u << 1 | 1];
if(root.add)
{
left.add += root.add, left.maxx += root.add;
right.add += root.add, right.maxx += root.add;
root.add = 0;
}
}
void build(int u, int l, int r)
{
if(l == r) tr[u] = {l, r, a[l], 0};
else
{
tr[u] = {l, r};
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pushup(u);
}
}
void modify(int u, int l, int r, int d)
{
if(tr[u].l >= l && tr[u].r <= r)
{
tr[u].maxx += d;
tr[u].add += d;
}
else
{
pushdown(u);
int mid = tr[u].l + tr[u].r >> 1;
if(l <= mid) modify(u << 1, l, r, d);
if(r > mid) modify(u << 1 | 1, l, r, d);
pushup(u);
}
}
int query(int u, int l, int r)
{
if(tr[u].l >= l && tr[u].r <= r) return tr[u].maxx;
pushdown(u);
int mid = tr[u].l + tr[u].r >> 1;
int v = 0;
if(l <= mid) v = query(u << 1, l, r);
if(r > mid) v = max(v, query(u << 1 | 1, l, r));
return v;
}
void dfs(int u)
{
in[u] = ++idx;
seq[idx] = u;
for(int i = 0; i < G[u].size(); i++)
{
int j = G[u][i];
dfs(j);
}
out[u] = idx;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n - 1; i++)
{
int x, y;
cin >> x >> y;
G[x].push_back(y);
din[y]++;
}
int root;
for(int i = 1; i <= n; i++)
if(din[i] == 0) {
root = i;
break;
}
dfs(root);
// for(int i = 1; i <= idx; i++) cout << seq[i] << " "; cout << endl;
// cout << in[5] << " " << out[5] << endl;
build(1, 1, n);
int q;
cin >> q;
while(q--)
{
int op, l, r;
cin >> op;
if(op == 1){
int x, k;
cin >> x >> k;
l = in[x], r = out[x];
modify(1, l, r, k);
}
else
{
int x;
cin >> x;
l = in[x], r = out[x];
cout << query(1, l, r) << endl;
}
}
return 0;
}