제출 #172772

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
172772	2020-01-02 15:15:49	tselmegkh	금 캐기 (IZhO14_divide)	C++14	100 / 100	291 ms	8824 KiB

divide

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;
const int N = 1e5 + 5;
int x[N], g[N], d[N];
bool vis[N];
long long tree[4 * N], lazy[4 * N], pref[N];
void push(int v, int l, int r, int val){
  if(l != r){
    lazy[v * 2] += val;
    lazy[v * 2 + 1] += val;
  }
  tree[v] += val;
  lazy[v] = 0;
}
void update(int v, int l, int r, int ql, int qr, int val){
  if(l > r)return;
  push(v, l, r, lazy[v]);
  if(ql > r || qr < l)return;
  if(ql <= l && qr >= r){
    push(v, l, r, val);
    return;
  }
  int mid = (l + r) / 2;
  update(v * 2, l, mid, ql, qr, val);
  update(v * 2 + 1, mid + 1, r, ql, qr, val);
  tree[v] = max(tree[v * 2], tree[v * 2 + 1]);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 52 / 52