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 ar[N+10];
- int R[N+10];
- int main(){
- int n;
- scanf("%d", &n);
- for(int i=1;i<=n;i++) scanf("%d", &ar[i]);
- R[n] = ar[n];
- for(int i=n-1;i>=1;i--) R[i] = max(ar[i], R[i+1]);
- int mx = ar[1];
- for(int i=1;i<n;i++){
- mx = max(mx, ar[i]);
- printf("%d ", min(mx, R[i+1]));
- }
- return 0;
- }
- // ระวัง mem
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement