BZOJ1086(SCOI2005)[王室联邦]--树分块

【链接】
bzoj1086

【解题报告】

好像是树分块模板题，直接搞就可以了。

#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=1005,maxm=2005;
int n,m,tot,top,cnt,stk[maxn],ro[maxn],id[maxn],lnk[maxn],son[maxm],nxt[maxm];
inline char nc()
{
    static char buf[100000],*l,*r;
    if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
    if (l==r) return EOF; return *l++;
}
inline int Read()
{
    int res=0; char ch=nc();
    while (ch<'0'||ch>'9') ch=nc();
    while (ch>='0'&&ch<='9') res=res*10+ch-48,ch=nc();
    return res;
}
void Add(int x,int y) {son[++tot]=y; nxt[tot]=lnk[x]; lnk[x]=tot;}
void Dfs(int x,int fa)
{
    int las=top;
    for (int j=lnk[x]; j; j=nxt[j])
     if (son[j]!=fa)
      {
        Dfs(son[j],x);
        if (top-las>=m)
         {
            ro[++cnt]=x;
            while (top!=las) id[stk[top]]=cnt,top--;
         }
      }
    stk[++top]=x;
}
int main()
{
    freopen("1086.in","r",stdin);
    freopen("1086.out","w",stdout);
    n=Read(); m=Read(); tot=cnt=top=0;
    memset(lnk,0,sizeof(lnk));
    for (int i=1,x,y; i<n; i++) x=Read(),y=Read(),Add(x,y),Add(y,x);
    Dfs(1,0);
    while (top) id[stk[top]]=cnt,top--;
    printf("%d\n",cnt);
    for (int i=1; i<n; i++) printf("%d ",id[i]); printf("%d\n",id[n]);
    for (int i=1; i<cnt; i++) printf("%d ",ro[i]); printf("%d\n",ro[cnt]);
    return 0;
}