#include <bits/stdc++.h>
#define pb push_back
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
int k, n;
cin >> k >> n;
int m, a;
vector<vector<int>> meetings, cnt;
meetings.pb(vector<int>(n, 0));
cnt.pb(vector<int>(n, 0));
for (int i = 1; i < k; ++i) {
cin >> m;
meetings.pb(vector<int>(m, 0));
cnt.pb(vector<int>(m, 0));
for (int j = 0; j < m; ++j)
{
cin >> meetings[i][j];
}
}
int result = 0;
for (int i = k - 1; i >= 0; --i) {
int perDay = 0;
for (int j = 0; j < meetings[i].size(); ++j) {
if (cnt[i][j] == 0 || i == k - 1) {
cnt[i][j] = 1;
}
if (meetings[i][j] > 0) {
cnt[i-1][meetings[i][j] - 1] += cnt[i][j];
}
perDay += cnt[i][j];
}
result = max(perDay, result);
}
cout << result;
}
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 | #include <bits/stdc++.h> #define pb push_back using namespace std; int main() { ios_base::sync_with_stdio(0); int k, n; cin >> k >> n; int m, a; vector<vector<int>> meetings, cnt; meetings.pb(vector<int>(n, 0)); cnt.pb(vector<int>(n, 0)); for (int i = 1; i < k; ++i) { cin >> m; meetings.pb(vector<int>(m, 0)); cnt.pb(vector<int>(m, 0)); for (int j = 0; j < m; ++j) { cin >> meetings[i][j]; } } int result = 0; for (int i = k - 1; i >= 0; --i) { int perDay = 0; for (int j = 0; j < meetings[i].size(); ++j) { if (cnt[i][j] == 0 || i == k - 1) { cnt[i][j] = 1; } if (meetings[i][j] > 0) { cnt[i-1][meetings[i][j] - 1] += cnt[i][j]; } perDay += cnt[i][j]; } result = max(perDay, result); } cout << result; } |
English