답안 #1095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1095 2013-06-25T06:10:43 Z comicos 줄 세우기 (KOI13_jul) C++
22 / 22
182 ms 8776 KB
#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 1 ms 8776 KB Output is correct
2 Correct 1 ms 8776 KB Output is correct
3 Correct 0 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 24 ms 8776 KB Output is correct
5 Correct 51 ms 8776 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 8776 KB Output is correct
2 Correct 130 ms 8776 KB Output is correct
3 Correct 144 ms 8776 KB Output is correct
4 Correct 168 ms 8776 KB Output is correct
5 Correct 174 ms 8776 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 182 ms 8776 KB Output is correct
2 Correct 170 ms 8776 KB Output is correct
3 Correct 170 ms 8776 KB Output is correct
4 Correct 176 ms 8776 KB Output is correct
5 Correct 174 ms 8776 KB Output is correct