#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 i,n,cnt = 1,max = 0;
scanf ("%d",&n);
for (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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
8776 KB |
Output is correct |
2 |
Correct |
0 ms |
8776 KB |
Output is correct |
3 |
Correct |
0 ms |
8776 KB |
Output is correct |
4 |
Correct |
0 ms |
8776 KB |
Output is correct |
5 |
Correct |
0 ms |
8776 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
8776 KB |
Output is correct |
2 |
Correct |
0 ms |
8776 KB |
Output is correct |
3 |
Correct |
0 ms |
8776 KB |
Output is correct |
4 |
Correct |
0 ms |
8776 KB |
Output is correct |
5 |
Correct |
0 ms |
8776 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
8776 KB |
Output is correct |
2 |
Correct |
1 ms |
8776 KB |
Output is correct |
3 |
Correct |
1 ms |
8776 KB |
Output is correct |
4 |
Correct |
2 ms |
8776 KB |
Output is correct |
5 |
Correct |
2 ms |
8776 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
8776 KB |
Output is correct |
2 |
Correct |
6 ms |
8776 KB |
Output is correct |
3 |
Correct |
12 ms |
8776 KB |
Output is correct |
4 |
Correct |
28 ms |
8776 KB |
Output is correct |
5 |
Correct |
49 ms |
8776 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
86 ms |
8776 KB |
Output is correct |
2 |
Correct |
110 ms |
8776 KB |
Output is correct |
3 |
Correct |
146 ms |
8776 KB |
Output is correct |
4 |
Correct |
182 ms |
8776 KB |
Output is correct |
5 |
Correct |
177 ms |
8776 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
171 ms |
8776 KB |
Output is correct |
2 |
Correct |
179 ms |
8776 KB |
Output is correct |
3 |
Correct |
174 ms |
8776 KB |
Output is correct |
4 |
Correct |
171 ms |
8776 KB |
Output is correct |
5 |
Correct |
180 ms |
8776 KB |
Output is correct |