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

using namespace std;

typedef long long ll;

int k, n, a, curr, maks;
vector<int> graf[500000];
vector<int> dp[500000];

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

    cin >> k >> n;
    for (int j = 0; j < n; j++)
    {
        graf[0].push_back(0);
        dp[0].push_back(0);
    }
    for (int i = 1; i < k; i++)
    {
        cin >> n;
        for (int j = 0; j < n; j++)
        {
            cin >> a;
            graf[i].push_back(a);
            dp[i].push_back(0);
        }
    }

    for (int i = k-1; i >= 0; i--)
    {
        curr = 0;
        for (int j = 0; j < graf[i].size(); j++)
        {
            if (dp[i][j] == 0) dp[i][j] = 1;
            curr += dp[i][j];
            if (graf[i][j] != 0) dp[i-1][graf[i][j]-1] += dp[i][j];
        }
        maks = max(maks, curr);
    }
    cout << maks;

    return 0;
}