1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second

typedef long long ll;

const int MAXN = 1e6 + 7;

int n_arr[MAXN];
int offset[MAXN];
int p_id[MAXN];
ll w[MAXN];
ll sum_w[MAXN];

void solve(){
	
	int k;
	cin >> k >> n_arr[1];
	
	offset[1] = 0;
	int total = n_arr[1];
	
	for(int i = 2; i <= k; i++){
		
		cin >> n_arr[i];
		offset[i] = total;
		
		for(int j = 1; j <= n_arr[i]; j++){
			
			int a;
			cin >> a;
			
			if(a > 0){
				
				p_id[offset[i] + j] = offset[i - 1] + a;
			}
			else {
				
				p_id[offset[i] + j] = 0;
			}
		}
		
		total += n_arr[i];
	}
	
	for(int i = total; i >= 1; i--){
		
		w[i] = max(1LL, sum_w[i]);
		
		if(p_id[i] > 0){
			
			sum_w[p_id[i]] += w[i];
		}
	}
	
	ll ans = 0;
	
	for(int i = 1; i <= k; i++){
		
		ll akt = 0;
		
		for(int j = 1; j <= n_arr[i]; j++){
			
			akt += w[offset[i] + j];
		}
		
		ans = max(ans, akt);
	}
	
	cout << ans << '\n';
}

bool multi = 0;

int main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	int t = 1;
	if(multi) cin >> t;
	while(t--){
	
		solve();
	}

	return 0;
}