Submission #2631

#	Time	Username	Problem	Language	Result	Execution time	Memory
2631		kipa00	줄 세우기 (KOI13_jul)	C++98	22 / 22	176 ms	4992 KiB

jul

#include <cstdio>
int a[1000001];

int main() {
	int N, i, max = -1, cnt = 0;
	int last = -1;
	scanf("%d", &N);
	for (i=1; i<=N; ++i) {
		int j;
		scanf("%d", &j);
		a[j] = i;
	}
	for (i=1; i<=N; ++i) {
		if (last < a[i]) {
			++cnt;
		} else {
			if (max < cnt) {
				max = cnt;
			}
			cnt = 0;
		}
		last = a[i];
	}
	printf("%d\n", N - max - 1);
	return 0;
}

• Subtask 1: 2.2 / 2.2
• Subtask 2: 3.3 / 3.3
• Subtask 3: 3.3 / 3.3
• Subtask 4: 4.4 / 4.4
• Subtask 5: 4.4 / 4.4
• Subtask 6: 4.4 / 4.4