제출 #1153

#제출 시각아이디문제언어결과실행 시간메모리
1153kriii줄 세우기 (KOI13_jul)C++98
22 / 22
175 ms4792 KiB
#include <stdio.h>

int N,I[1000100],U;

int main()
{
	int i,x,l;

	scanf ("%d",&N);
	for (i=1;i<=N;i++){
		scanf ("%d",&x);
		I[x] = i;
	}
	
	U = l = 1;
	for (i=2;i<=N;i++){
		if (I[i-1] < I[i]) l++;
		else l = 1;
		if (U < l) U = l;
	}

	printf ("%d",N-U);

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...