# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386237 | patrikpavic2 | Money (IZhO17_money) | C++17 | 2 ms | 380 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 <cstdio>
#include <cstring>
#include <vector>
#include <set>
#include <algorithm>
#define X first
#define Y second
#define PB push_back
using namespace std;
const int N = 1e6 + 500;
int A[N], n, prv[N], nxt[N], sol;
multiset < int > S;
int main(){
scanf("%d", &n);
for(int i = 0;i < n;i++){
scanf("%d", A + i);
S.insert(A[i]);
}
for(int i = n - 1;i >= 0;i--){
S.erase(S.lower_bound(A[i]));
int rub1 = 1, rub2 = 0;
while(i > 0 && A[i] >= *S.begin() && ((!rub2 && (A[i - 1] == *(--S.upper_bound(A[i])) || A[i - 1] == *(--S.lower_bound(A[i])))) || A[i - 1] == A[i])){
if(A[i - 1] != *(--S.upper_bound(A[i]))){
if(rub1) rub1 = 0;
else rub2 = 1;
}
i--; S.erase(S.lower_bound(A[i]));
}
sol++;
}
printf("%d\n", sol);
}
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... |