id=2533

Description

Input

Output

Sample Input

1 7 3 5 9 4 8

Sample Output

Source

附上AC代码：

#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef unsigned int UI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
const double pi = acos(-1.0);
const double e = exp(1.0);
const int maxn = 1005;
int num[maxn];
int dp[maxn];

int main()
{
	ios::sync_with_stdio(false);
	int n;
	while (scanf("%d", &n) != EOF)
	{
		for(int i=0; i<n; i++)
			scanf("%d", &num[i]);
		dp[0] = 1;
		for (int i=1; i<n; i++)
		{
			dp[i] = 1;
			for (int j=0; j<i; j++)
				if (num[j] < num[i])
					dp[i] = max(dp[i], dp[j]+1);
		}
		int ans = 0;
		for (int i=0; i<n; i++)
			ans = max(ans, dp[i]);
		printf("%d\n", ans);
	}
	return 0;
}