longest2.c

来自「Problem B:Longest Ordered Subsequence A」· C语言 代码 · 共 28 行

#include <stdio.h>
#define MAX 1000
int a[MAX+1],maxlen[MAX+1];
int N=1,i,j,max,count;
int main()
{
	while(N!=0)
	{
		scanf("%d",&N);
		for (i=1; i<=N; i++)
		scanf("%d",&a[i]);
		maxlen[1]=1;
		for (i=2; i<=N; i++) {
		max=0;
		for (j=1; j<i; j++)
		if (a[j]<a[i])
			if (maxlen[j]>max)
			max=maxlen[j];
			maxlen[i]=max+1;
		}
		count=-1;
		for (i=1; i<=N; i++)
		if (maxlen[i]>count)
		count=maxlen[i];
		if (N!=0)printf("%d\n",count);
	}
}