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
#include <iostream>
#include <vector>

using namespace std;


using vi = vector<int>;




const int MAXK = 500000 + 6;

vi graf[MAXK];
int mininr[MAXK];
int ile[MAXK];
int maxinr[MAXK];

int main() {    
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int k, n;
    cin >> k >> n;

    int aktnr = n;
    maxinr[0] = n - 1;

    for (int i = 1; i < k; i++) {
        cin >> n;
        mininr[i] = aktnr;
        for (int j = 0; j < n; j++) {
            int val;
            cin >> val;
            maxinr[i] = aktnr;

            if (val != 0) {
                graf[mininr[i - 1] + val - 1].push_back(aktnr);
            }
            aktnr++;
        }
    }

    int ans = 0;


    for (int i = k - 1; i >= 0; i--) {
        int ans2 = 0;
        for (int j = mininr[i]; j <= maxinr[i]; j++) {
            int sum = 0;
            for (int s : graf[j]) {
                sum += ile[s];
            }
            sum = max(sum, 1);
            ile[j] = sum;
            //cout << j << ' ' << ile[j] << '\n';
            ans2 += sum;
        }
        //cout << i << ' ' << ans2 << ' ' << mininr[i] << ' ' << maxinr[i] << '\n';
        ans = max(ans, ans2);
    }


    cout << ans << '\n';

    


    return 0;
}