Query on a tree 树剖第一题

题目链接

题意：
给你一颗树，现在有两个操作，一种是改变某条边的权值，一种是查询点u到v之间的路径的最大边权。

 

直接抄fold的模版（逃

 

///                 .-~~~~~~~~~-._       _.-~~~~~~~~~-.
///             __.'              ~.   .~              `.__
///           .'//                  \./                  \\`.
///        .'//                     |                     \\`.
///       .'// .-~"""""""~~~~-._     |     _,-~~~~"""""""~-. \\`.
///     .'//.-"                 `-.  |  .-'                 "-.\\`.
///   .'//______.============-..   \ | /   ..-============.______\\`.
/// .'______________________________\|/______________________________`.
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/STACK:102400000,102400000")
//#pragma GCC target(sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx) 
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <fstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define pf printf
typedef long long LL;
typedef pair <int, int> ii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e5+10;
//const int maxx=1e7+10;
const double EPS=1e-8;
const double eps=1e-8;
const LL mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

int n;
int a[maxn];
struct node {
	int l,r,val;
}tree[maxn];

void pushup(int id) {
	tree[id].val=max(tree[id<<1].val,tree[id<<1|1].val);
}
void build(int id,int l,int r) {
	tree[id].l=l,tree[id].r=r;
	if(l==r) {
		tree[id].val=a[l];
		return ;
	}
	int mid=(l+r)>>1;
	build(id<<1,l,mid);
	build(id<<1|1,mid+1,r);
	pushup(id);
}
void update(int id,int l,int r,int val){
	if(tree[id].l==tree[id].r) {
		tree[id].val=val;
		return ;
	}
	int mid=(tree[id].l+tree[id].r)>>1;
	if(l<=mid) update(id<<1,l,r,val);
	if(r>mid) update(id<<1|1,l,r,val);
	pushup(id);
}
int query(int id,int l,int r) {
	if(tree[id].l>=l&&tree[id].r<=r) {
		return tree[id].val;
	}
	int mid=(tree[id].l+tree[id].r)>>1,res1=0,res2=0;
	if(l<=mid) res1=query(id<<1,l,r);
	if(r>mid) res2=query(id<<1|1,l,r); 
	return max(res1,res2);
}

struct edge {
	int nex,id,val;
	edge(int nex,int id,int val):
		nex(nex),id(id),val(val) {}
};

int pre[maxn],siz[maxn],dep[maxn];
int top[maxn],edge_id[maxn],heavy[maxn];
int val[maxn],ith[maxn];
int idx=1;
vector<edge>G[maxn];


void init() {
	idx=1;
	memset(a,0,sizeof(a));
    memset(ith,0,sizeof(ith));
    memset(val,0,sizeof(val));
    memset(top,0,sizeof(top));
    memset(pre,0,sizeof(pre));
    memset(siz,0,sizeof(siz));
    memset(dep,0,sizeof(dep));
    memset(heavy,0,sizeof(heavy));
    memset(tree,0,sizeof(tree));
    memset(edge_id,0,sizeof(edge_id));
    for(int i=1;i<=n;i++) G[i].clear();
}
int dfs(int x,int fa,int depth) {
	dep[x]=depth,pre[x]=fa;
	int res=1,maxx=0;
	int len=G[x].size();
	for(int i=0;i<len;i++) {
		int y=G[x][i].nex;
		if(y==fa) continue;
		int sz=dfs(y,x,depth+1);
		ith[G[x][i].id]=y;
		val[y]=G[x][i].val;
		if(sz>maxx) maxx=sz,heavy[x]=y;
		res+=sz;
	}
	return siz[x]=res;
}
//第一遍求deep pre siz
 
void slpf(int x,int fa,int tp) {
	int len=G[x].size();
	if(pre[x]) edge_id[x]=idx++;
	top[x]=tp;
	if(heavy[x]) slpf(heavy[x],x,tp);
	for(int i=0;i<len;i++) {
		int y=G[x][i].nex;
		if(y==fa) continue;
		if(y!=heavy[x]) 
			slpf(y,x,y);
	}
}
//edge_id[x]  x到父亲的边在序列中的位置
//重链上的重边需要相邻 所以先处理重儿子
//top[x]  x到重链顶端节点的id  轻边就是本身

 
int getmax(int x,int y) {
	int ans=0,res;
	for(;top[x]!=top[y];x=pre[top[x]]) {
		if(dep[top[x]]<dep[top[y]]) swap(x,y);
		res=query(1,edge_id[top[x]],edge_id[x]);
		if(res>ans) ans=res;
	}
	if(dep[x]==dep[y]) return ans;
	if(dep[x]>dep[y]) swap(x,y); 
	if(edge_id[heavy[x]]>edge_id[y]) swap(x,y);
	res=query(1,edge_id[heavy[x]],edge_id[y]);
	return max(ans,res);
}
//每次取深度大的点向上跳，直到两点在同一重链 
void solve() {
	init();
	s_1(n);
	FOr(1,n,i) {
		int x,y,z;
		s_3(x,y,z);
		G[x].pb(edge(y,i,z));
		G[y].pb(edge(x,i,z));
	}
	dfs(1,0,1);
	slpf(1,0,1);
	FOR(1,n,i) 
		if(pre[i]) a[edge_id[i]]=val[i];
	build(1,1,n-1);
	W(1) {
		char op[10];
		int x,y;
		scanf("%s",op);
		if(op[0]=='D') break;
		s_2(x,y);
		if(op[0]=='Q') pf("%d\n",getmax(x,y));
		if(op[0]=='C') update(1,edge_id[ith[x]],edge_id[ith[x]],y);
	}
	puts("");
}
int main() {
	//freopen( "1.in" , "r" , stdin );
    //freopen( "1.out" , "w" , stdout );
    int t=1;
    //init();
    s_1(t);
    for(int cas=1;cas<=t;cas++) {
        //printf("Case #%d: ",cas);
        solve();
    }
}