怎么又刷水题?
f[i][j]表示以i为根的子树i的权值为j的最小总权值
咦?这不是O(n^2)的嘛?
SDOI2015R2D2T2 doc证明了整棵树最多只能用到O(log n)种颜色
%考场上敢自信开大数组的人
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#define maxn 10010
using namespace std;
int f[maxn][20],g[20];
int head[maxn],to[2*maxn],next[2*maxn];
int n,num;
void addedge(int x,int y)
{
num++;to[num]=y;next[num]=head[x];head[x]=num;
}
void dfs(int x,int fa)
{
for (int p=head[x];p;p=next[p])
if (to[p]!=fa)
{
dfs(to[p],x);
for (int i=1;i<=14;i++) g[i]=200000;
int mn=200000;
for (int i=1;i<=14;i++) mn=min(mn,f[to[p]][i]),g[i+1]=min(g[i+1],mn);
mn=200000;
for (int i=14;i>=1;i--) mn=min(mn,f[to[p]][i]),g[i-1]=min(g[i-1],mn);
for (int i=1;i<=14;i++) f[x][i]+=g[i];
}
for (int i=1;i<=14;i++) f[x][i]+=i;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
addedge(x,y);addedge(y,x);
}
dfs(1,0);
int ans=200000;
for (int i=1;i<=14;i++) ans=min(ans,f[1][i]);
printf("%d\n",ans);
return 0;
}