POJ 1949 Chores 动态规划

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int dis[10005];
int main()
{
int n;
while(~scanf("%d",&n))
{
memset(dis,0,sizeof(dis));
int res = 0,v,t,p;
for(int i = 1;i <= n;++i)
{
scanf("%d%d",&v,&t);
dis[i] = 0;
for(int j = 0;j < t;++j)
{
scanf("%d",&p);
dis[i] = max(dis[i],dis[p]);
}
dis[i] += v;
res = max(dis[i],res);
}
printf("%d\n",res);
}
}