Submission #1047410

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1047410	2024-08-07 12:41:18	PagodePaiva	Real Mountains (CCO23_day1problem2)	C++17	10 / 25	900 ms	19044 KiB

Main

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
    #include<bits/stdc++.h>
    #define resp1 resp
    #define int long long
    using namespace std;
     
    const int N = 1000010;
    int res[N];
    const int mod = 1e6+3;
     
    int32_t main(){
        int n;
        cin >> n;
        vector <int> v;
        int idxmax = 0;
        for(int i = 0;i < n;i++){
            int x;
            cin >> x;
            v.push_back(x);
            if(x > v[idxmax]) idxmax = i;
        }
        int pref = 0;
        for(int i = 0;i < idxmax;i++){
            pref = max(pref, v[i]);
            res[i] = pref;
        }
        pref = 0;
        for(int i = n-1;i > idxmax;i--){
            pref = max(pref, v[i]);
            res[i] = pref;
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 0 / 3
• Subtask 4: 0 / 3
• Subtask 5: 4 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 4