最长路径

#include<stdio.h>
#include<stdlib.h>

int g[1000][1000],n,s,p[1000];
int dfs(int x,int y){
    int i,j,k;
    k=1;
    for (i=1;i<=n;i++)
        if (g[x][i]==1 && p[i]==0){
            p[i]=1;
            k=0;
            
            dfs(i,y+1);
            p[i]=0; 
        }
    if (k==1){s=y;return 0;}
    return s;
}
    
    
int main(){
    int i,j,k,l,m,ans=-1,tmp=0;
    scanf("%d",&n);
    int x,y; 
    for (i=1;i<=n-1;i++){
        scanf("%d%d",&x,&y);
        g[x][y]=1;
        g[y][x]=1;
    }
    for (i=1;i<=n;i++){
        for (j=1;j<=n;j++)p[j]=0;
        p[i]=1;
        tmp=dfs(dfs(i,0),0);
        if (tmp>ans)ans=tmp;
    }
    printf("%d",ans);
    system("pause");
    return 0;
}