#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define sz(x) ((int)x.size())
#define i2 array<int,2>
using namespace std;
typedef long long ll;
const int N = 1000100;
const int C = 22;
const int md = 10007;
set<i2> ps;
set<i2>::iterator iter;
int n, a[N], ans, nm[N];
bool mrk[N];
int mult(int x, int y) { return (x * y) % md; }
void SUM(int &x, int y){
x += y;
if (x >= md)
x -= md;
}
bool cmp(int _x, int _y){
if (a[_x] == a[_y])
return _x < _y;
else return a[_x] > a[_y];
}
int main() {
#ifdef _LOCAL
freopen("in.txt","r",stdin); // freopen("output.txt","w",stdout);
#else
// freopen("mining.in","r",stdin); freopen("mining.out","w",stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
nm[i] = i;
}
sort(nm + 1, nm + n + 1, cmp);
for (int i = n; i > 0; i--)
ps.insert({a[i], i});
int ptr = 1;
while (1){
while (ptr <= n && mrk[nm[ptr]])
ptr++;
if (ptr > n) break;
ans++;
int pst = nm[ptr], vl = a[nm[ptr]];
mrk[pst] = 1;
while (pst != 0){
if (sz(ps) == 0) break;
iter = ps.upper_bound({vl - 1, pst});
if (iter == ps[vl - 1].end()) break;
if ((*iter)[] != vl - 1) break;
pserase(iter);
pst = (*iter)[1];
vl--;
mrk[pst] = 1;
}
}
cout << ans;
return 0;
}
Compilation message
baloni.cpp: In function 'int main()':
baloni.cpp:72:27: error: no match for 'operator[]' (operand types are 'std::set<std::array<int, 2> >' and 'int')
if (iter == ps[vl - 1].end()) break;
^
baloni.cpp:74:25: error: expected primary-expression before ']' token
if ((*iter)[] != vl - 1) break;
^
baloni.cpp:76:13: error: 'pserase' was not declared in this scope
pserase(iter);
^~~~~~~
