# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
311760 | kaplanbar | Baloni (COCI15_baloni) | C++14 | 1291 ms | 42232 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;
using ll = long long;
constexpr int N = 1e6+5;
int n;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
int mx = 0;
map<int,set<int>> v;
for(int i = 0; i < n; i++) {
int x;
cin >> x;
v[-x].insert(i);
mx = max(mx, x);
}
int c = 0;
for(auto &x : v) {
if(x.second.empty()) continue;
c++;
int now = -x.first;
int pos = -1;
while(v[-now].upper_bound(pos) != v[-now].end()) {
pos = *v[-now].upper_bound(pos);
v[-now].erase(pos);
now--;
}
}
cout << c << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |