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
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define st first
#define nd second
#define ld long double

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int k;
    cin >> k;
    vector<int> n (k);
    cin >> n[0];
    if (k==1) {
        cout << n[0] << '\n';
        return 0;
    }
    vector<int> w (n[0]+1, 0);
    int s = 0;
    for (int i = 1; i < k; i++) {
        cin >> n[i];
        for (int j = 0; j < n[i]; j++) {
            int x;
            cin >> x;
            if (x==0) {
                w.push_back(0);
            }
            else {
                w.push_back(s+x);
            }
        }
        s += n[i-1];
    }
    int m = w.size();
    vector<vector<int>> g (m);
    vector<int> r (m, 1);
    for (int i = m-1; i > 0; i--) {
        if (w[i] != 0) {
            g[w[i]].push_back(i);
        }
        int pom = 0;
        for (int j : g[i]) {
            pom += r[j];
        }
        r[i] = max(1, pom);
    }
    int ans = 0;
    int in = 0;
    for (int i = 0; i < k; i++) {
        int pom = 0;
        for (int j = 0; j < n[i]; j++) {
            in++;
            pom += r[in];
        }
        ans = max(ans, pom);
    }
    cout << ans << '\n';
}