【BZOJ 3611】 [Heoi2014]大工程|虚树|树上DP

虚树好神啊！！

没有初始化RE好无奈啊！！

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
const int MAXN=1000000+10;
int tot,g[MAXN*2],nnext[MAXN*2],num[MAXN*2];
int go[MAXN][21]; //20
int dfn[MAXN],depth[MAXN],size[MAXN];
int team[MAXN],head,tail;
int read()
{
	char c=getchar();int x=0;
	while (c<'0'||c>'9') c=getchar();
	while (c>='0'&&c<='9'&&!feof(stdin)) x=x*10+c-'0',c=getchar();
	return x;
}
void add(int x,int y)
{
	tot++;
	nnext[tot]=g[x];
	g[x]=tot;
	num[tot]=y;
}
void init()
{
	int n=read();
	for(int i=1;i<n;i++)
	{
		int x=read(),y=read();
		add(x,y);add(y,x);
	}
	team[++tail]=1;
	depth[1]=1;
	while(head!=tail)
	{
		int x=team[++head];
		for(int i=1;i<=20;i++) go[x][i]=go[go[x][i-1]][i-1];
		for(int i=g[x];i;i=nnext[i])
		{
			int tmp=num[i];
			if(tmp==go[x][0]) continue;
			depth[tmp]=depth[x]+1;
			go[tmp][0]=x;
			team[++tail]=tmp;
		}
	}
	for(int i=n;i>=1;i--)
	{
		int x=team[i];
		size[x]=1;
		for(int j=g[x];j;j=nnext[j])
		{
			if(num[j]==go[x][0]) continue;
			size[x]+=size[num[j]];
		}
	}
	dfn[1]=1;
	for(int i=1;i<=n;i++)
	{
		int x=team[i];
		int cnt=dfn[x];
		for(int j=g[x];j;j=nnext[j])
		{
			if(num[j]==go[x][0]) continue ;
			dfn[num[j]]=cnt+1;
			cnt+=size[num[j]];
		}
	}
}
int t[MAXN],top;
bool cmp(int a,int b) {return dfn[a]<dfn[b];}
LL r1;int r2,r3;
int k;
int lca(int x,int y)
{
	if(depth[x]<depth[y]) swap(x,y);
	if(depth[x]!=depth[y])
	for(int i=20;i>=0;i--)
		if(depth[go[x][i]]>=depth[y])
			x=go[x][i];
	if(x==y) return x;
	for(int i=20;i>=0;i--)
		if(go[x][i]!=go[y][i])
			x=go[x][i],y=go[y][i];
	return go[x][0];
}
struct two{int mmax,mmin;};
two dfs(int x)
{
	bool flag=size[x];
		
	int max1=0,max2=0;
	int min1=MAXN,min2=MAXN;
	
	for(int i=g[x];i;i=nnext[i])
	{
		int tmp=num[i];
		
		two y=dfs(num[i]);
		size[x]+=size[num[i]];
		
		int lenth=depth[x]+depth[num[i]]-depth[lca(x,num[i])]*2;
		r1+=(LL)(k-size[num[i]])*size[num[i]]*lenth;
		
		int mmax=lenth+y.mmax;
		if(mmax>max1) max2=max1,max1=mmax;
		else if(mmax>max2) max2=mmax;
		
		int mmin=lenth+y.mmin;
		if(mmin<min1) min2=min1,min1=mmin;
		else if(mmin<min2) min2=mmin;
	}
	two ans;
	r2=max(r2,max1+max2); ans.mmax=max1;
	if(flag) r3=min(r3,min1),ans.mmin=0;
	else r3=min(r3,min1+min2),ans.mmin=min1;
	return ans;
}
void solve()
{
	k=read();tail=k;
	for(int i=1;i<=k;i++) team[i]=read();
	sort(team+1,team+k+1,cmp);
	top=0;t[++top]=team[1];
	for(int i=2;i<=k;i++)
	{
		int x=team[i];int tmp=lca(t[top],x);
		if(tmp==t[top]) {t[++top]=x;continue;}
		while(top>=2 && tmp==lca(t[top-1],x))
		{
			add(t[top-1],t[top]);
			top--;
			tmp=lca(x,t[top]);
			if(tmp==t[top])break;
		}
		if(tmp!=t[top])
		{
			add(tmp,t[top]);
			t[top]=tmp;team[++tail]=tmp;
		}
		t[++top]=x;
	}
	while(top>=2) add(t[top-1],t[top]),top--;
	for(int i=1;i<=k;i++) size[team[i]]=1;
	r1=0,r2=-MAXN,r3=MAXN;dfs(t[1]);
	printf("%lld %d %d\n",r1,r3,r2);
	for(int i=1;i<=tail;i++) g[team[i]]=0,size[team[i]]=0;tot=0;
}
int main()
{
//	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
	init();
	memset(size,0,sizeof(size));
	memset(g,0,sizeof(g));tot=0;
	int q=read();
	for(int i=1;i<=q;i++) solve();
	return 0;
}