#include <iostream> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k, result = 2020; cin >> n >> k; vector<vector<int>> years(n, vector<int>(n, 0)); vector<vector<int>> steps(n, vector<int>(n, 0)); for (int i = 0; i < n; ++i) { for (int j = 0; j <= i; ++j) { cin >> years[i][j]; } } for (int i = 0; i < n; ++i) { steps[i][0] = i + 1; steps[i][i] = i + 1; if (i + 1 <= k) { result = min(result, years[i][0]); result = min(result, years[i][i]); } } for (int i = 2; i < n; ++i) { for (int j = 1; j < i; ++j) { steps[i][j] = steps[i - 1][j - 1] + steps[i - 1][j] - steps[i - 2][j - 1] + 1; if (steps[i][j] <= k) { result = min(result, years[i][j]); } } } cout << result << "\n"; return 0; }
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 51 | #include <iostream> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k, result = 2020; cin >> n >> k; vector<vector<int>> years(n, vector<int>(n, 0)); vector<vector<int>> steps(n, vector<int>(n, 0)); for (int i = 0; i < n; ++i) { for (int j = 0; j <= i; ++j) { cin >> years[i][j]; } } for (int i = 0; i < n; ++i) { steps[i][0] = i + 1; steps[i][i] = i + 1; if (i + 1 <= k) { result = min(result, years[i][0]); result = min(result, years[i][i]); } } for (int i = 2; i < n; ++i) { for (int j = 1; j < i; ++j) { steps[i][j] = steps[i - 1][j - 1] + steps[i - 1][j] - steps[i - 2][j - 1] + 1; if (steps[i][j] <= k) { result = min(result, years[i][j]); } } } cout << result << "\n"; return 0; } |