#include <bits/stdc++.h>
using namespace std;
const int MAX_RAGETREE_SZ = 300005;
int ragetreesum[4 * MAX_RAGETREE_SZ];
int ragetreemin[4 * MAX_RAGETREE_SZ];
int ragetreelazy[4 * MAX_RAGETREE_SZ];
int n;
void pushdown(int idx) {
ragetreelazy[2*idx] += ragetreelazy[idx];
ragetreelazy[2*idx+1] += ragetreelazy[idx];
ragetreelazy[idx] = 0;
}
void pullup(int idx) {
ragetreesum[idx] = ragetreesum[2*idx] + ragetreesum[2*idx+1];
ragetreemin[idx] = min(ragetreemin[2*idx] + ragetreelazy[2*idx], ragetreemin[2*idx+1], ragetreelazy[2*idx+1]);
}
void ragetreedec(int idx, int lhs, int rhs, int l, int r) {
if(lhs >= l && rhs <= r && ragetreemin[idx] + ragetreelazy[idx] - 1 > 0) {
ragetreelazy[idx]--;
return;
}
if(lhs == rhs) {
ragetreesum[idx]++;
ragetreemin[idx] = 1e9;
return;
}
pushdown(idx);
int mid = (lhs+rhs)/2;
if(mid >= l) ragetreedec(2*idx, lhs, mid, l, r);
if(mid+1 <= r) ragetreedec(2*idx+1, mid+1, rhs, l, r);
pullup(idx);
}
int ragetreequery(int idx, int lhs, int rhs, int l, int r) {
if(lhs >= l && rhs <= r) return ragetreesum[idx];
int ret = 0;
int mid = (lhs+rhs)/2;
if(mid >= l) ret += ragetreequery(2*idx, lhs, mid, l, r);
if(mid+1 <= r) ret += ragetreequery(2*idx+1, mid+1, rhs, l, r);
return ret;
}
int k;
void ragetreeinit(int idx, int lhs, int rhs, int *D) {
if(lhs == rhs) {
if(D[lhs] >= k) {
ragetreesum[idx] = 1;
ragetreemin[idx] = 1e9;
}
else {
ragetreemin[idx] = k - D[lhs];
}
return;
}
int mid = (lhs+rhs)/2;
ragetreeinit(2*idx, lhs, mid, D);
ragetreeinit(2*idx+1, mid+1, rhs, D);
pullup(idx);
}
void inicjuj(int nn, int kk, int *D) {
n = nn;
k = kk;
for(int i = 0; i < n; i++) D[i] = k - D[i];
ragetreeinit(1, 0, n-1, D);
}
// inc [a, b] by 1
void podlej(int a, int b) {
ragetreedec(1, 0, n-1, a, b);
}
// count
int dojrzale(int a, int b) {
return ragetreequery(1, 0, n-1, a, b);
}
Compilation message
In file included from /usr/include/c++/7/bits/char_traits.h:39:0,
from /usr/include/c++/7/ios:40,
from /usr/include/c++/7/istream:38,
from /usr/include/c++/7/sstream:38,
from /usr/include/c++/7/complex:45,
from /usr/include/c++/7/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:52,
from kon.cpp:1:
/usr/include/c++/7/bits/stl_algobase.h: In instantiation of 'constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare) [with _Tp = int; _Compare = int]':
kon.cpp:19:111: required from here
/usr/include/c++/7/bits/stl_algobase.h:246:17: error: '__comp' cannot be used as a function
if (__comp(__b, __a))
~~~~~~^~~~~~~~~~
