POJ - 2533 Longest Ordered Subsequence
Posted 西北会法语
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了POJ - 2533 Longest Ordered Subsequence相关的知识,希望对你有一定的参考价值。
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence ( a1, a2, ..., aN) be any sequence ( ai1, ai2, ..., 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
Output
Sample Input
7 1 7 3 5 9 4 8
Sample Output
4
f[i]=max{f[j]}+1 (j<i 且a[j]<a[i])
1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 5 using namespace std; 6 7 int a[1005],f[1005]; 8 9 int main() 10 { 11 int n,maxx=0; 12 scanf("%d",&n); 13 for(int i=1;i<=n;i++) 14 scanf("%d",&a[i]); 15 //memset(f,1,sizeof(int)); 16 for(int i=1;i<=n;i++) 17 f[i]=1; 18 for(int i=2;i<=n;i++) 19 { 20 for(int j=1;j<i;j++) 21 { 22 if(a[i]>a[j]&&f[i]<f[j]+1) 23 f[i]=f[j]+1; 24 } 25 // cout<<i<<" "<<f[i]<<endl; 26 } 27 for(int i=1;i<=n;i++) 28 if(f[i]>maxx) 29 maxx=f[i]; 30 printf("%d\n",maxx); 31 32 return 0; 33 }
以上是关于POJ - 2533 Longest Ordered Subsequence的主要内容,如果未能解决你的问题,请参考以下文章
POJ 2533 Longest Ordered Subsequence
POJ2533:Longest Ordered Subsequence
POJ 2533 Longest Ordered Subsequence(裸LIS)
poj 2533 Longest Ordered Subsequence(LIS)