记录编号	268029	评测结果	AAAAAAAAAA
题目名称	圣诞树	最终得分	100
用户昵称	洛克索耶夫	是否通过	通过
代码语言	C++	运行时间	0.003 s
提交时间	2016-06-11 20:21:34	内存使用	0.32 MiB

#include<bits/stdc++.h>

int n , maxn = 0;
int a[110] = {0}, out[110] = {0}, sum[110] = {0};
bool beside[110][110] = {false}, used[110] = {false};
//queue <int> Q;
int f[110];

int GetMax(int a, int b)
{
	return a > b ? a : b;
}

void BFS/*??*/(int x)
{
	used[x] = true;
	for(int i = 1; i <= n; i++){
		if(beside[i][x]){
			out[i]--;
			sum[i] = GetMax(sum[i], sum[x] + a[i]);
			if(!out[i] && !used[i]){
				//cout<<"BFS:"<<i<<endl;
				BFS(i);
			}	
		}
	}
}

int main()
{
	int __size__ = 32 << 20;
	char *__p__ = (char*)malloc(__size__)+__size__;
	__asm__("movl %0, %%esp\n"::"r"(__p__));
	freopen("treez.in", "r", stdin);freopen("treez.out", "w", stdout);
	
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%d", &a[i]);
		sum[i] = a[i];   
		char ch = getchar();
		while(ch!='\n'&&ch!='\r')
		{
			int b;
			scanf("%d", &b);
			if(scanf("%c", &ch) == EOF)break;
			out[i]++;
			beside[i][b] = true;
		}          
	}
		
	for(int i = 1; i <= n; i++)	{
		if(!out[i] && !used[i]){
			//cout<<"BFS:"<<i<<endl;
			BFS(i);
		}	
	}
		
	for(int i = 1; i <= n; i++){
		//printf("sum[%d]:%d\n", i, sum[i]);
		maxn = GetMax(maxn, sum[i]);
	}	
	printf("%d", maxn);
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}
/*
3
12 2 3
20
30
*/
/*
6
2 2 5
3
2
1
4 3 6
1 3 4
*/
/*
10
8 2 4 5 7
14 3 5 6
2
17 5 6
33 6 7 8
26 8 9
15 8 9 10
17 9 10
19
6
*/