Submission #816883

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
816883	2023-08-09 07:13:43	acatmeowmeow	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++11	13 / 100	1580 ms	92168 KiB

sortbooks

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 N = 1e6;
int n, m, arr[N + 5];
struct info {
  int res = 0, mx = 0, mn = 1e18;
  info operator+(info x) {
    info ans;
    ans.res = max({res, x.res, mx > x.mn ? mx + x.mn : 0});
    ans.mx = max(mx, x.mx);
    ans.mn = min(mn, x.mn);
    return ans;
  }
};
info tree[4*N + 5];
void update(int v, int tl, int tr, int k, int x) {
  if (tl == tr) tree[v].mx = tree[v].mn = x;
  else {
    int tm = (tl + tr)/2;
    if (k <= tm) update(v*2, tl, tm, k, x);
    else update(v*2 + 1, tm + 1, tr, k, x);
    tree[v] = tree[v*2] + tree[v*2 + 1];
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 13 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23