Tree Cutting POJ - 2378

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
int dp[10005][2],num;
vector<int>p[10005];  
vector<int>vec;
void dfs(int node,int fa)
{

    dp[node][0]=1;
    for(int i=0;i<p[node].size();i++)
    {

            if(p[node][i]==fa)continue;
            dfs(p[node][i],node);
            dp[node][0]+=dp[p[node][i]][0];
            dp[node][1]=max(dp[p[node][i]][0],dp[node][1]);
    }
    if(num-dp[node][0]<=num/2&&dp[node][1]<=num/2)
    vec.push_back(node);

}
int main()
{
    while(~scanf("%d",&num))
    {
        vec.clear();
        memset(dp,0,sizeof(dp));
        int root=-1;
        for(int i=2;i<=num;i++)
        {
            int out ,to;
            scanf("%d %d",&out,&to);
            p[out].push_back(to);  
            p[to].push_back(out);  
        }
    dfs(1,-1);
    sort(vec.begin(),vec.end());
    if(vec.size()>=0)
    for(int i=0;i<vec.size();i++)
    cout<<vec[i]<<endl;
    else
    cout<<"NONE";
    }
    return 0;
}