Submission #580495

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
580495	2022-06-21 10:47:13	amunduzbaev	Global Warming (CEOI18_glo)	C++17	100 / 100	424 ms	16692 KiB

glo

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 ar array
typedef int64_t ll;
#define int ll
const int N = 4e5 + 5;
int a[N];
struct ST{
  int tree[N << 2];
  void sett(int i, int v, int lx = 0, int rx = N, int x = 1){
    if(lx == rx) { tree[x] = v; return; }
    int m = (lx + rx) >> 1;
    if(i <= m) sett(i, v, lx, m, x << 1);
    else sett(i, v, m + 1, rx, x << 1 | 1);
    tree[x] = max(tree[x << 1], tree[x << 1 | 1]);
  }
  
  int get(int l, int r, int lx = 0, int rx = N, int x = 1){
    if(lx > r || rx < l) return 0;
    if(lx >= l && rx <= r) return tree[x];
    int m = (lx + rx) >> 1;
    return max(get(l, r, lx, m, x << 1), get(l, r, m + 1, rx, x << 1 | 1));
  }
}tree;
int pref[N], suff[N];
signed main(){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 13 / 13
• Subtask 4: 10 / 10
• Subtask 5: 20 / 20
• Subtask 6: 17 / 17
• Subtask 7: 25 / 25