# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1102 | comicos | 줄 세우기 (KOI13_jul) | C++98 | 0 ms | 0 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 <stdio.h>
#define M 1010000
int a [M],d [M];
int main (void)
{
// freopen ("input29.txt","r",stdin);
// freopen ("output.txt","w",stdout);
int n,cnt = 1,max = 0;
scanf ("%d",&n);
for (int i = 1; i <= n; i++)
{
scanf ("%d",&a[i]);
d [a[i]] = i;
}
for (i = 1; i <= n; i++)
{
if (d [i] < d[i + 1])
cnt++;
else
cnt = 1;
if (cnt > max)
max = cnt;
}
printf ("%d",n - max);
return 0;
}