题解:
贪心,能一直走就一直走,否则就算它是返回(就是多加一个点用两步)
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=12100;
int v,n;
struct node{
int x,y,next;
}sa[N];int len=0,first[N];
void ins(int x,int y)
{
len++;
sa[len].x=x;
sa[len].y=y;
sa[len].next=first[x];
first[x]=len;
}
int dep[N],ans=0;
void dfs(int x,int fa)
{
if(dep[x]>n) return; //printf("%d %d %d\n",dep[x],x,fa);
ans=max(ans,dep[x]+n+2>>1);
//printf("%d !%d\n",ans,dep[x]);
for(int i=first[x];i!=-1;i=sa[i].next)
{
int y=sa[i].y;
if(y!=fa)
{
dep[y]=dep[x]+1;
dfs(y,x);
}
}
}
int main()
{
scanf("%d%d",&v,&n);
memset(first,-1,sizeof(first));
int x,y;
for(int i=1;i<v;i++)
{
scanf("%d%d",&x,&y);
ins(x,y);ins(y,x);
}
dep[0]=0;
dfs(0,-1);
if(ans>v) ans=v;
printf("%d\n",ans);
}