Submission #17592

#	Time	Username	Problem	Language	Result	Execution time	Memory
17592		comet	줄 세우기 (KOI13_jul)	C++98	22 / 22	215 ms	4988 KiB

jul

#include <cstdio>
#include <algorithm>

using namespace std;

int d[1000001];
int main(){
	int N,a,ans=0;
	scanf("%d",&N);
	for(int i=0;i<N;i++){
		scanf("%d",&a);
		d[a]=d[a-1]+1;
		ans = max(ans,d[a]);
	}
	printf("%d",N-ans);
}

• 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