第一道树形DP,完全没有思路,参考自别人的解题报告。。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
namespace
{
int n, p[1500], dp[1500][2];
map<int, vector<int> > tree;
void dfs(int node)
{
dp[node][0] = 0;
dp[node][1] = 1;
vector<int> &child = tree[node];
for (size_t i = 0; i < child.size(); i++)
{
dfs(child[i]);
dp[node][0] += dp[child[i]][1];
dp[node][1] += min(dp[child[i]][0], dp[child[i]][1]);
}
}
}
int main()
{
while (scanf("%d", &n) != EOF)
{
int i, par, child, count;
memset(p, -1, sizeof(p));
tree.clear();
for (i = 0; i < n; i++)
{
scanf("%d:(%d)", &par, &count);
vector<int> V;
while (count--)
{
scanf("%d", &child);
V.push_back(child);
p[child] = par;
}
tree[par] = V;
}
int root = 0;
while (p[root] != -1)
root = p[root];
dfs(root);
printf("%d\n", min(dp[root][0], dp[root][1]));
}
return 0;
}