# POJ - 2533 Longest Ordered Subsequence

Longest Ordered Subsequence
 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 59740 Accepted: 26772

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

### 题意：求最长上升子序列；

AC代码：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>

using namespace std;

const int maxn = 1111;
int q[maxn];

int main()
{
int n, c;
scanf("%d", &n);
int now = 1;
q[0] = -1;
for(int i = 0; i < n; i++){
scanf("%d", &c);
if(c > q[now - 1]){
q[now] = c;
now++;
}
else if(c == q[now - 1])
continue;
else{
int l = 0, r = now;
while(l < r){
int m = (l + r) / 2;
if(q[m] > c)
r = m;
else
l = m + 1;
}
q[l] = c;
}
}
printf("%d\n", now - 1);
return 0;
}