POJ 2533 Longest Ordered Subsequence
2013-07-05 21:45
399 查看
大致题意:求最长升子序列。
f[i]:前i+1个元素中包括第i+1个的最长升子序列。
f[i]:前i+1个元素中包括第i+1个的最长升子序列。
// Time 32ms; Memory 224K
#include<iostream> using namespace std; int main() { int i,j,n,a[1010],f[1010],max; cin>>n; for(i=0;i<n;i++) cin>>a[i]; f[0]=1; for(i=1;i<n;i++) { f[i]=1; for(j=0;j<i;j++) if(a[i]>a[j] && f[i]<=f[j]) { f[i]=f[j]+1; } } max=0; for(i=0;i<n;i++) if(max<f[i]) max=f[i]; cout<<max<<endl; return 0; }
相关文章推荐
- POJ 2533 Longest Ordered Subsequence(DP最长上升子序列O(n^2)&&O(nlogn))
- POJ 2533: Longest Ordered Subsequence
- POJ2533——Longest Ordered Subsequence(简单的DP)
- poj 2533:Longest Ordered Subsequence 求最长递增序列长度
- N - Longest Ordered Subsequence POJ 2533 (最长上升子序列 )
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- POJ-2533(LIS) Longest Ordered Subsequence
- Longest Ordered Subsequence - POJ 2533 最长上升子序列
- poj 2533 Longest Ordered Subsequence
- POJ2533 Longest ordered subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence(dp LIS)
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- Longest Ordered Subsequence(POJ--2533
- poj 2533 Longest Ordered Subsequence
- poj2533——longest ordered subsequence