Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int N = 1e6;
- int tower[N + 10], mnOfMx[N + 10];
- int nTower;
- int main(){
- scanf("%d", &nTower);
- int mx = 0;
- for(int i = 1; i <= nTower; ++i){
- scanf("%d", &tower[i]);
- mx = max(mx, tower[i]);
- mnOfMx[i] = mx;
- }
- mx = 0;
- for(int i = nTower - 1; i >= 1; --i){
- mx = max(mx, tower[i + 1]);
- mnOfMx[i] = min(mx, mnOfMx[i]);
- }
- for(int i = 1; i < nTower; ++i){
- cout << mnOfMx[i] << " ";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement