# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94415 | Kastanda | Money (IZhO17_money) | C++11 | 264 ms | 18808 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;
const int N = 1000006;
int n, cnt, A[N], C[N], nxt[N];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]), C[A[i]] ++;
C[N - 1] ++;
for (int i = N - 2; i; i--)
{
nxt[i] = i + 1;
while (!C[nxt[i]])
nxt[i] = nxt[nxt[i]];
}
for (int i = n; i;)
{
int used = 0;
int l = i - 1;
while (l)
{
C[A[l + 1]] --;
if (A[l] > A[l + 1])
break;
if (A[l] == A[l + 1])
{
l --;
continue;
}
while (!C[nxt[A[l]]])
nxt[A[l]] = nxt[nxt[A[l]]];
if (nxt[A[l]] < A[l + 1])
break;
if (nxt[A[l]] == A[l + 1] && used)
break;
used = 1;
l --;
}
i = l;
cnt ++;
}
return !printf("%d", cnt);
}
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... |