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
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
vector<vector<ll>> vec, dp; 
vector<ll> zap;
ll n, k1, k, x; 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n>>k1;
    
    dp.resize(n);
    dp[0].resize(k1);

    for(int i=0; i<k1; i++) 
        zap.push_back(-1);

    vec.push_back(zap);
    
    for(int i=0; i<n-1; i++) {
        zap.clear();
        cin>>k;
    
        for(int j=0; j<k; j++) {
            cin>>x;
            zap.push_back(x-1);
        }
    
        vec.push_back(zap);
        dp[i+1].resize(k);
    }
    for(int i=n-1; i>=0; i--) {
        for(int j=0; j<vec[i].size(); j++) {
            dp[i][j] = max(dp[i][j], (ll)1);
            if(i == 0 or vec[i][j] == -1) continue;
            
            dp[i-1][vec[i][j]] += dp[i][j];
        }
    }
    long long res_temp = 0, res = 0;
    for(int i=0; i<n; i++) {
        for(auto& k : dp[i]) {
            res_temp += k;
        }
        res = max(res, res_temp);
        res_temp = 0;
    }
    cout<<res;
}