The more, The Better
Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6874 Accepted Submission(s): 4036
請無視代碼裏的字符處理……上課做的實驗題,找到相似題改了一下就搬過來了。
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3
const int N=10005;
const int mod=1e9+7;
int score[205];
vector<int> son[205];
int dp[205][205];
string s[205][205];
void dfs(int n,int left){
dp[n][1]=score[n];
if (n!=0) {
stringstream ss;
ss<<n;
s[n][1]=ss.str();
s[n][1]+=" ";
}
for (int i=0; i<son[n].size(); i++) {
if (left>1) dfs(son[n][i], left-1);
for (int j=left; j>=1; j--) {
for (int k=1; k<=j; k++) {
if (dp[n][j+1]<dp[n][j+1-k]+dp[son[n][i]][k]){
dp[n][j+1]=dp[n][j+1-k]+dp[son[n][i]][k];
s[n][j+1]=s[n][j+1-k]+s[son[n][i]][k];
}
}
}
}
}
int main() {
int n,m,a,b,c;
n=100;
while (cin>>n>>m&&n) {
memset(score, 0, sizeof(score));
memset(dp, 0, sizeof(dp));
for (int i=0; i<=n; i++) {
son[i].clear();
}
for (int i=0; i<n; i++) {
a=i+1;
cin>>b>>c;
son[b].push_back(a);
score[a]=c;
}
dfs(0, m+1);
cout<<dp[0][m+1]<<endl;
}
return 0;
}