#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int k, n;
cin >> k >> n;
vector <vector <int>> v(k + 1), ile(k + 1);
v[0].resize(n + 1, 0);
ile[0].resize(n + 1, 0);
for (int i = 1; i < k; i++) {
cin >> n;
v[i].resize(n + 1);
ile[i].resize(n + 1, 0);
for (int j = 1; j <= n; j++) {
cin >> v[i][j];
}
}
for (int i = k - 1; i >= 0; i--) {
for (int j = 1; j < v[i].size(); j++) {
if (ile[i][j] == 0) ile[i][j] = 1;
if (v[i][j] != 0) ile[i - 1][v[i][j]] += ile[i][j];
}
}
int ans = 0;
for (int i = 0; i < k; i++) {
ans = max(ans, accumulate(ile[i].begin(), ile[i].end(), 0));
}
cout << ans << '\n';
}
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 | #include "bits/stdc++.h" using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int k, n; cin >> k >> n; vector <vector <int>> v(k + 1), ile(k + 1); v[0].resize(n + 1, 0); ile[0].resize(n + 1, 0); for (int i = 1; i < k; i++) { cin >> n; v[i].resize(n + 1); ile[i].resize(n + 1, 0); for (int j = 1; j <= n; j++) { cin >> v[i][j]; } } for (int i = k - 1; i >= 0; i--) { for (int j = 1; j < v[i].size(); j++) { if (ile[i][j] == 0) ile[i][j] = 1; if (v[i][j] != 0) ile[i - 1][v[i][j]] += ile[i][j]; } } int ans = 0; for (int i = 0; i < k; i++) { ans = max(ans, accumulate(ile[i].begin(), ile[i].end(), 0)); } cout << ans << '\n'; } |
English