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
#include <iostream>
#include <vector>
using namespace std;
int main() {
  int k;
  int n;
  int ans = 0;
  int sum;
  cin >> k >> n;
  vector<vector<int>> tab(k), dp(k);
  tab[0] = vector<int>(n, 0);
  dp[0] = vector<int>(n, 0);
  for (int i = 1; i < k; ++i) {
    cin >> n;
    tab[i] = vector<int>(n);
    dp[i] = vector<int>(n, 0);
    for (int j = 0; j < n; ++j) {
      cin >> tab[i][j];
    }
  }
  for (int i = k - 1; i >= 0; --i) {
    sum = 0;
    for (int j = 0; j < tab[i].size(); ++j) {
      if (dp[i][j] == 0) {
        dp[i][j] = 1;
      }
      if (tab[i][j] != 0) {
        dp[i - 1][tab[i][j]-1] += dp[i][j];
      }
      sum += dp[i][j];
    }
    ans = max(sum, ans);
  }
  // for (int i=0;i<dp.size();++i){
  //   for (int j=0;j<dp[i].size();++j) {
  //     cout<<dp[i][j]<<" ";
  //   }
  //   cout<<endl;
  // }
  cout<<ans;
}