P4719 [模板] 动态DP

传送门

考虑普通的DP

考虑用树剖维护, 令

转换为矩阵

这里乘法变成加法，加法变成max

留一个LCT的坑 

---

#include<bits/stdc++.h>
#define N 100050
#define inf 1000000000
using namespace std;
int first[N],next[N*2],to[N*2],tot;
void add(int x,int y){
	next[++tot] = first[x], first[x] = tot, to[tot] = y; 
}
int n,m,a[N],leaf[N];
int dep[N],id[N],fa[N],top[N],siz[N],son[N],sign;
int f[N][2],g[N][2];
int read(){
	int cnt=0,f=1; char ch=0;
	while(!isdigit(ch)){ch=getchar(); if(ch=='-') f=-1;}
	while(isdigit(ch))cnt=cnt*10+(ch-'0'),ch=getchar();
	return cnt * f;
}
struct Matrix{
	int a[2][2];
	Matrix(){a[0][0] = a[0][1] = a[1][0] = a[1][1] = -inf;}
	Matrix(int x,int y){
		a[0][0] = a[0][1] = x; a[1][0] = y; a[1][1] = -inf;
	}
	Matrix friend operator * (const Matrix &A, const Matrix &B){
		Matrix C;
		for(int i=0;i<=1;i++)
			for(int j=0;j<=1;j++)
				for(int k=0;k<=1;k++)
					C.a[i][j] = max(C.a[i][j], A.a[i][k] + B.a[k][j]);
		return C;
	}
};
struct Segmentree{
	Matrix sum[N<<2];
	void Pushup(int x){ sum[x] = sum[x<<1] * sum[x<<1|1];}
	void Modify(int x,int l,int r,int pos,Matrix val){
		if(l==r){ sum[x] = val; return;}
		int mid = (l+r) >> 1;
		if(pos<=mid) Modify(x<<1,l,mid,pos,val);
		else Modify(x<<1|1,mid+1,r,pos,val);
		Pushup(x);
	}
	Matrix Quary(int x,int l,int r,int L,int R){
		if(L<=l && r<=R) return sum[x];
		int mid = (l+r) >> 1; Matrix ans;
		ans.a[0][0] = ans.a[1][1] = 0;
		if(L<=mid) ans = ans * Quary(x<<1,l,mid,L,R);
		if(R>mid) ans = ans * Quary(x<<1|1,mid+1,r,L,R);
		return ans;
	}
}Seg;
void dfs(int u,int ffa){
	siz[u] = 1; f[u][1] = a[u];
	for(int i=first[u];i;i=next[i]){
		int t = to[i]; if(t==ffa) continue;
		dep[t] = dep[u] + 1, fa[t] = u;
		dfs(t,u); siz[u] += siz[t];
		f[u][1] += f[t][0];
		f[u][0] += max(f[t][0], f[t][1]);
		if(siz[son[u]] < siz[t]) son[u] = t;
	}
}
void dfs2(int u,int Top){
	top[u] = Top, id[u] = ++sign, g[u][1] = a[u];
	if(son[u]) dfs2(son[u], Top);
	else leaf[Top] = u;
	for(int i=first[u];i;i=next[i]){
		int t=to[i]; if(t==fa[u]||t==son[u]) continue;
		dfs2(t,t);
		g[u][0] += max(f[t][0], f[t][1]);
		g[u][1] += f[t][0];
	} Seg.Modify(1,1,n,id[u],Matrix(g[u][0], g[u][1]));
}
void Update(int x){
	Seg.Modify(1,1,n,id[x],Matrix(g[x][0], g[x][1])); 
	x = top[x];
	while(x>1){
		Matrix tmp = Seg.Quary(1,1,n,id[x],id[leaf[x]]);
		g[fa[x]][0] -= max(f[x][0], f[x][1]);
		g[fa[x]][1] -= f[x][0];
		f[x][0] = tmp.a[0][0], f[x][1] = tmp.a[1][0];
		g[fa[x]][0] += max(f[x][0], f[x][1]);
		g[fa[x]][1] += f[x][0];
		Seg.Modify(1,1,n,id[fa[x]],Matrix(g[fa[x]][0], g[fa[x]][1]));
		x = top[fa[x]];
	}
}
int main(){
	n = read(), m = read();
	for(int i=1;i<=n;i++) a[i] = read();
	for(int i=1;i<n;i++){
		int x = read(), y = read();
		add(x,y); add(y,x);
	} dep[1] = 1, dfs(1,0); dfs2(1,1);
	while(m--){
		int x = read(), val = read();
		g[x][1] -= a[x]; a[x] = val; g[x][1] += a[x];
		Update(x);
		Matrix Ans = Seg.Quary(1,1,n,id[1],id[leaf[1]]);
		int ans = max(Ans.a[0][0], Ans.a[1][0]);
		printf("%d\n",ans);
	} return 0;
}