# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161949 | Tyx2019 | Real Mountains (CCO23_day1problem2) | C++20 | 4 ms | 3144 KiB |
#include <bits/stdc++.h>
#define int long long
#define debug(x) if(1) cout << #x << " = " << x << endl;
using namespace std;
const int maxN = 5005;
const int INF = 1e18;
int A[maxN];
main(){
int N;
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
int mx = 0;
for(int i=0;i<N;i++) mx = max(mx, A[i]);
int s = INT_MAX;
int e = 0;
assert(N<=maxN);
for(int i=0;i<N;i++){
assert(1<=A[i]);
assert(A[i]<=100);
if(A[i] == mx){
s = min(s, i);
e = max(e, i);
}
}
int B[N];
for(int i=s;i<=e;i++) B[i] = mx;
int cur = 0;
for(int i=0;i<s;i++){
cur = max(cur, A[i]);
B[i] = cur;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |