# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39376 | Extazy | Money (IZhO17_money) | C++14 | 0 ms | 6084 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>
#define endl '\n'
#define prev vahgkjahjka
#define next hajhqkjjkqkjq
using namespace std;
const int N = 1000007;
int n,a[N],ans;
vector < int > curr;
multiset < int > s;
multiset < int >::iterator prev(multiset < int >::iterator it) {
--it;
return it;
}
bool are_consecutive(int v1, int v2) {
if(v1==v2) return true;
return *prev(s.lower_bound(v2))==v1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i,j;
scanf("%d", &n);
for(i=1;i<=n;i++) {
scanf("%d", &a[i]);
s.insert(a[i]);
}
for(i=n;i>=1;) {
vector < int > curr;
curr.push_back(a[i]);
for(j=i-1;j>=1;j--) {
if(are_consecutive(a[j],a[j+1])) {
curr.push_back(a[j]);
}
else {
break;
}
}
for(j=0;j<(int)(curr.size());j++) {
s.erase(s.find(curr[j]));
}
i-=(int)(curr.size());
++ans;
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |