# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386234 | patrikpavic2 | Money (IZhO17_money) | C++17 | 1 ms | 368 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 <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;
vector < pair < int, int > > v;
void remove(int x){
prv[nxt[x]] = prv[x];
nxt[prv[x]] = nxt[x];
}
int main(){
scanf("%d", &n);
for(int i = 0;i < n;i++){
scanf("%d", A + i);
v.PB({A[i], i});
}
sort(v.begin(), v.end());
for(int i = 1;i <= n;i++)
A[v[i - 1].Y] = i;
nxt[0] = 0, prv[n + 1] = n;
for(int i = 1;i <= n;i++){
prv[i] = i - 1;
nxt[i] = i + 1;
}
for(int i = n - 1;i >= 0;i--){
int j = i;
while(i >= 0 && A[i - 1] == prv[A[i]]) i--;
for(int k = i;k <= j;k++) remove(A[k]);
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... |