poj 1155 TELE

/* source code of submission 401148, Zhongshan University Online Judge System */ //树型DP #include #include #include #include using namespace std; const int size=3000; const int inf=1<<28; int n,m; //POJ1155 树型DP struct node { int adj; int wt; node(){} node(int a,int w):adj(a),wt(w){} }; vector e[size+5]; int pay[size+5]; int dp[size+5][size+5]; //dp[i][j]表示以i为根的树选中j个人最大收益，答案就是符合dp[1][j]>=0的最大j int temp[size+5]; int num[size+5]; //num[i]表示以i为根节点的树的叶子节点树 void dfs(int v) { if (v>n-m) { dp[v][1]=pay[v]; //叶子节点为初始情况 num[v]=1; return ; } for (int i=0;i=0;i--) if (dp[1][i]>=0) { printf("%d/n",i); break; } } return 0; }