Submission #1162690

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1162690	2025-03-06 14:18:55	Pwo	Real Mountains (CCO23_day1problem2)	C++20	6 / 25	2350 ms	1114112 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>
using namespace std;
#define int long long
const int md = 1e6 + 3;
int n, a[5005], b[5005], pre[5005], suf[5005];
vector<pair<int, int>> v;
vector<pair<int, int>> op[5005];
 
int32_t main() {
  ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  cin >> n; for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) v.emplace_back(a[i], i);
  sort(v.begin(), v.end(), greater<pair<int, int>>());
  int j = 0, c = v[0].first;
  fill(b, b + n + 1, 1e9);
  
  pre[0] = 1e9; suf[n + 1] = 1e9;
  int lo = 1e9, hi = 0;
  while (j < n) {
    vector<int> idx;
    while (v[j].first == c) {
      idx.push_back(v[j].second);
      lo = min(lo, v[j].second);
      hi = max(hi, v[j].second);
      b[v[j].second] = c;
      j++;
    }
    
    vector<int> bad;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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