## howell

I just follow my heart ! ! !

# Longest Ordered Subsequence POJ - 2533 (最长有序子序列)

 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 59701 Accepted: 26753

Description

A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1a2, ..., aN) be any sequence (ai1ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).

Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.

Input

The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000

Output

Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.

Sample Input

7
1 7 3 5 9 4 8

Sample Output

4


Source

Northeastern Europe 2002, Far-Eastern Subregion

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;

const int maxn = 1e5+7;
int n, s[maxn], dp[maxn];

/*
if(s[j] > s[i]) dp[j] = max(dp[j] , dp[i] + 1);
*/

int main()
{
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%d", &s[i]);
dp[i] = 1;
}
for(int i = 0; i < n; i++) {
for(int j = i + 1; j < n; j++) {
if(s[j] > s[i]) dp[j] = max(dp[j], dp[i] + 1);
}
}
int maxl = 0;
for(int i = 0; i < n; i++)
maxl =max(maxl, dp[i]);
cout << maxl << endl;
return 0;
}


05-19 488

03-01 508

05-25 1198

06-02 1215

06-08 2136

10-28 742

03-08 5671

10-13 1412

07-03 660

04-17 1748