oj.uz

답안 #3149

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
3149 2013-08-26T08:28:38 Z movie_jo 줄 세우기 (KOI13_jul) C
22 / 22
 180 ms 4992 KB 
#include<stdio.h>
int N,x,y[1000001],i,S=1,M;
int main(void)
{
	scanf("%d",&N);
	for(i=1;i<=N;i++)
	{
		scanf("%d",&x);
		y[x]=i;
	}
	for(i=1;i<N;i++)
	{
		if(y[i]>y[i+1])
			S=1;
		else
		{
			S++;
			if(S>M)
				M=S;
		}
	}
	printf("%d",N-M);
}

Subtask #1
2.2 / 2.2

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 0 ms 4992 KB Output is correct
3 Correct 0 ms 4992 KB Output is correct
4 Correct 0 ms 4992 KB Output is correct
5 Correct 0 ms 4992 KB Output is correct

Subtask #2
3.3 / 3.3

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 0 ms 4992 KB Output is correct
3 Correct 0 ms 4992 KB Output is correct
4 Correct 0 ms 4992 KB Output is correct
5 Correct 0 ms 4992 KB Output is correct

Subtask #3
3.3 / 3.3

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 0 ms 4992 KB Output is correct
3 Correct 0 ms 4992 KB Output is correct
4 Correct 0 ms 4992 KB Output is correct
5 Correct 0 ms 4992 KB Output is correct

Subtask #4
4.4 / 4.4

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 24 ms 4992 KB Output is correct
5 Correct 44 ms 4992 KB Output is correct

Subtask #5
4.4 / 4.4

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 4992 KB Output is correct
2 Correct 116 ms 4992 KB Output is correct
3 Correct 148 ms 4992 KB Output is correct
4 Correct 176 ms 4992 KB Output is correct
5 Correct 176 ms 4992 KB Output is correct

Subtask #6
4.4 / 4.4

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 4992 KB Output is correct
2 Correct 160 ms 4992 KB Output is correct
3 Correct 180 ms 4992 KB Output is correct
4 Correct 160 ms 4992 KB Output is correct
5 Correct 172 ms 4992 KB Output is correct