POJ_2533_Longest Ordered Subsequence

Longest Ordered Subsequence

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 55490		Accepted: 24881

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

 

• 简单LIS

 

 

 1 #include <iostream>
 2 #include <string>
 3 #include <cstdio>
 4 #include <cstring>
 5 #include <algorithm>
 6 #include <climits>
 7 #include <cmath>
 8 #include <vector>
 9 #include <queue>
10 #include <stack>
11 #include <set>
12 #include <map>
13 using namespace std;
14 typedef long long           LL ;
15 typedef unsigned long long ULL ;
16 const int    maxn = 1000 + 10  ;
17 const int    inf  = 0x3f3f3f3f ;
18 const int    npos = -1         ;
19 const int    mod  = 1e9 + 7    ;
20 const int    mxx  = 100 + 5    ;
21 const double eps  = 1e-6       ;
22 const double PI   = acos(-1.0) ;
23 
24 int a[maxn], dp[maxn], ans, n;
25 int main(){
26     // freopen("in.txt","r",stdin);
27     // freopen("out.txt","w",stdout);
28     while(~scanf("%d",&n)){
29         ans=0;
30         for(int i=1;i<=n;i++){
31             scanf("%d",&a[i]);
32             dp[i]=1;
33             for(int j=i-1;j>0;j--)
34                 if(a[i]>a[j])
35                     dp[i]=max(dp[i],dp[j]+1);
36             ans=max(ans,dp[i]);
37         }
38         printf("%d\n",ans);
39     }
40     return 0;
41 }

 

 

 

转载于:https://www.cnblogs.com/edward108/p/7649018.html