poj 2533(裸的LIS,很少见的水题)

Longest Ordered Subsequence

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 29448		Accepted: 12812

Description

A numeric sequence of  a_i is ordered if  a₁ <  a₂ < ... <  a_N. Let the subsequence of the given numeric sequence ( a₁,  a₂, ...,  a_N) be any sequence ( a_i1,  a_i2, ...,  a_iK), where 1 <=  i₁ <  i₂ < ... <  i_K <=  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

 

用lower_bound实现的LIS，需要注意的是，如果题目要求严格递增，则必须用lower_bound，因为要替换掉相同的元素而不是增长序列。

如果题目要求最长不下降子序列，则必须用 upper_bound。

提交记录

1、Accepted！

 

/*Source Code

Problem: 2533  User: 775700879 
Memory: 704K  Time: 16MS 
Language: G++  Result: Accepted 

Source Code */
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
#include 
        
        
          #define MAXW 7510 #define oo 0x3f3f3f3f using namespace std; int dp[10010] = {0}; int main() { int n; cin >> n; int num; int i, j; int result = 0; for (i = 0; i < n; i++) { cin >> num; int * tmp = lower_bound(dp, dp+result, num);//严格的要 lower_bound!!! *tmp = num; if (tmp - dp == result) result++; } cout << result << endl; }