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

int main() {
    int k, n, workers = 0, a, sum_row;
    (void)scanf("%d %d", &k, &n);

    std::vector<std::vector<int>> v{}, v2{};
    v.push_back({});
    v2.push_back({});
    for(int i = 0; i < n; ++i){
        v2[0].emplace_back(0);
    }
    for(int i = 1; i < k; ++i){
        (void)scanf("%d", &n);
        v.push_back({});
        v[i].reserve(n);
        v2.push_back({});
        v2[i].reserve(n);

        for(int j = 0; j < n; ++j){
            (void)scanf("%d", &a);
            v[i].emplace_back(a);
            v2[i].emplace_back(0);
        }
    }

    for(int i = k-1; i > 0; --i){
        sum_row = 0;
        for(int j = 0; j < v[i].size(); ++j){
            v2[i][j] = std::max(v2[i][j], 1);
            if(v[i][j]){
                v2[i-1][v[i][j] - 1]+= v2[i][j];
            }
        }
        for(int j = 0; j < v[i].size(); ++j){
            sum_row += v2[i][j];
        }
        workers = std::max(workers, sum_row);
    }

    sum_row = 0;
    for(int i = 0; i < v2[0].size(); ++i){
        sum_row += std::max(v2[0][i], 1);
    }

    workers = std::max(workers, sum_row);
    printf("%d\n", workers);
    fflush(stdout);

    return 0;
}