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

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int days, n;
    cin >> days >> n;
    vector<vector<int>> meetings;
    vector<vector<int>> people;
    meetings.push_back(vector<int>(n));
    people.push_back(vector<int>(n));
    for (int i = 1; i < days; i++)
    {
        cin >> n;
        meetings.push_back(vector<int>(n));
        people.push_back(vector<int>(n));
        for (int j = 0; j < n; j++)
        {
            int from;
            cin >> from;
            people[i][j] = from;
        }
    }

    for (int i = days - 1; i >= 0; i--)
    {
        for (int j = 0; j < meetings[i].size(); j++)
        {
            meetings[i][j] = max(meetings[i][j], 1);
            int last_meeting = people[i][j];
            if (last_meeting != 0 && i != 0)
            {
                meetings[i - 1][last_meeting - 1] += meetings[i][j];
            }
        }
    }

    int max_people = 0;

    for (int layer = 0; layer < days; layer++)
    {
        int current_people = 0;
        for (int i = 0; i < meetings[layer].size(); i++)
        {
            current_people += meetings[layer][i];
        }
        max_people = max(max_people, current_people);
    }
    cout << max_people << endl;
}