# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44690 | heon | Baloni (COCI15_baloni) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int maxn = 10000005;
int n;
set <int> st[maxn];
int x[maxn];
auto nadi(int id, int height){
auto it = st[height].lower_bound(id);
if(it == st[height].end()) return -1;
return *it;
}
int main(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> x[i];
st[x[i]].insert(i);
}
int sol = 0;
for(int i = 0; i < n; i++){
if(!st[x[i]].count(i)) continue;
sol++;
int pos = i;
while(pos >= 0){
st[x[pos]].erase(pos);
pos = nadi(pos,x[pos]-1);
}
}
cout << sol;
}