Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int main()
- {
- ifstream fin("INPUT.TXT");
- ofstream fout("OUTPUT.TXT");
- int n;
- fin >> n;
- vector<vector<int>> vec(n, vector<int>(n, 0));
- for (int i = 0; i < n; i++)
- for (int j = 0; j < n; j++) if(j==i) fin >> vec[i][j];
- int c = (n - 1) % 2;
- for (int i = 1; i < n; i++) {
- if(i%2 == c)
- for (int j = i, k = 0; j < n; j++, k++)
- vec[j][k] = max(vec[j - 1][k], vec[j][k + 1]);
- else
- for (int j = i, k = 0; j < n; j++, k++)
- vec[j][k] = min(vec[j - 1][k], vec[j][k + 1]);
- }
- fout << vec[n - 1][0];
- fout.close();
- fin.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment