2141638_wa.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>

void input()
{
	int i, j, N;
	int max, ans;
	int seq[1001], dp[1001];

	scanf("%d",&N);
	ans = -1;
	for(i = 0; i < N; i++)
	{
		scanf("%d",&seq[i]);
		if(!i)
			dp[i] = 1;
		else
		{
			max = -1;
			for(j = i - 1; j >= 0; j--)
				if(seq[j]<seq[i]&&dp[j]>max)
					max = dp[j];
			dp[i] = max+1;
		}
		if(dp[i]>ans)
			ans = dp[i];
	}
	printf("%d\n",ans);
}

int main()
{
	input();
	return 1;
}