Submission #1189

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189		gs13068	줄 세우기 (KOI13_jul)	C++98	22 / 22	201 ms	12604 KiB

jul

#include<cstdio>

int a[1000000];
int b[1000001];
int dy[1000000];

int main()
{
	int i,n;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		b[a[i]]=i;
	}
	for(i=0;i<n;i++)
	{
		if(a[i]>1&&b[a[i]-1]<i)
			dy[i]=dy[b[a[i]-1]]+1;
		else
			dy[i]=1;
	}
	for(i=1;i<n;i++)
	{
		if(dy[i]>dy[0])
			dy[0]=dy[i];
	}
	printf("%d",n-dy[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