# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112408 | vjudge1 | Baloni (COCI15_baloni) | C++17 | 2072 ms | 3664 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;
int main() {
int a;
cin >> a;
vector<int> d(a);
for (int i = 0; i < a; i++) {
cin >> d[i];
}
int s = 0;
while (!d.empty()) {
int max_value = *max_element(d.begin(), d.end());
auto it = find(d.begin(), d.end(), max_value);
int maxi = distance(d.begin(), it);
int ua = -1;
for (int i = maxi; i < d.size() - 1; i++) {
if (d[i] - 1 == d[i + 1]) {
d.erase(d.begin() + i);
ua = i;
i--;
} else {
break;
}
}
if (ua != -1 && ua < d.size()) {
d.erase(d.begin() + ua);
}
s++;
}
cout << s;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |