[CF1039D You Are Given a Tree]树形DP

[CF1039D You Are Given a Tree]

Code

---

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
using namespace std;
const int N=5e5;
struct node{int y,n;}e[N];
int lin[N],ans[N],f[N],g[N],val,len=1,n,x,y;
void read(int x,int y)
{e[++len].y=y,e[len].n=lin[x],lin[x]=len;}
void dfs(int x,int fa,int k){
	f[x]=0,g[x]=1;
	int maxn1=0,maxn2=0;
	for(int i=lin[x];i;i=e[i].n){
		int y=e[i].y;
		if(y==fa)continue;
		dfs(y,x,k); f[x]+=f[y];
		if(g[y]>maxn1)maxn2=maxn1,maxn1=g[y];
		else maxn2=max(maxn2,g[y]);
	}
	if(maxn1+maxn2+1>=k)f[x]++,g[x]=0;
	else g[x]=maxn1+1;
}
void sol(int l,int r,int L,int R){
    if (l>r||L>R) return;
    if (L==R){
        for (int i=l;i<=r;i++) ans[i]=L;
        return;
    }
    int mid=(l+r)>>1;dfs(1,0,mid); ans[mid]=f[1];
    sol(l,mid-1,ans[mid],R); sol(mid+1,r,L,ans[mid]);
}
int main()
{
	//freopen("a.in","r",stdin);
	scanf("%d",&n);
	rep(i,2,n){scanf("%d%d",&x,&y);read(x,y),read(y,x);}
	sol(1,n,0,n);
	rep(i,1,n)printf("%d\n",ans[i]);
	return 0;
}

• DP的细节调了半天
• 可能自己写的二分比较睿智，直接T飞
• 换了题解的一种更简洁的分治写法