1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N, i, q, a[502], b[502];
vector<vector<int>>v;
int A(int x) { 
	if (b[x])	return b[x]; 
	for (int t : v[x])	b[x] = max(b[x], A(t));
	b[x] += a[x]; 
	return b[x]; 
}
int main() {
	cin >> N; 
	v.resize(N + 1);
	for (i = 1; i <= N; i++) { 
		cin >> a[i] >> q; 
		while (q != -1)	v[i].push_back(q), cin >> q; 
	}
	for (i = 1; i <= N; i++)	cout << A(i) << endl;
}