poj 2533 Longest Ordered Subsequence (最长子序列)
2012-07-30 19:04
393 查看
点击打开链接
简单最长子序列模版
简单最长子序列模版
#include"stdio.h" #include"string.h" int dp[1010]; int main() { int i,j; int n; int a[1010]; int max; while(scanf("%d",&n)!=EOF) { memset(dp,0,sizeof(dp)); for(i=0;i<n;i++) scanf("%d",&a[i]); dp[0]=1; for(i=1;i<n;i++) { max=0; for(j=0;j<i;j++) { if(a[i]>a[j]) { if(max<dp[j]) max=dp[j]; } } dp[i]=max+1; } max=0; for(i=0;i<n;i++) { if(dp[i]>max) max=dp[i]; } printf("%d\n",max); } return 0; }
相关文章推荐
- poj 2533 Longest Ordered Subsequence (最长子序列)
- POJ 2533 Longest Ordered Subsequence(最长非递减子序列,LIS)
- POJ_2533 Longest Ordered Subsequence【DP】【最长上升子序列】
- POJ 2533 Longest Ordered Subsequence【最长递增子序列】【DP思想】
- //POj 2533 Longest Ordered Subsequence(动态规划:最长不减子序列)
- poj 2533 Longest Ordered Subsequence 最长上升子序列,nlogn复杂度
- POJ-2533-Longest Ordered Subsequence-最长递增子序列-动态规划
- poj-2533 Longest Ordered Subsequence 【最长上升子序列】
- 【POJ 2533】Longest Ordered Subsequence(dp求最长增序列的长度)
- 求最大上升序列的二分搜索算法 poj 2533 Longest Ordered Subsequence
- Longest Ordered Subsequence【POJ 2533 dp 最长不降子序列】
- N - Longest Ordered Subsequence POJ 2533 (最长上升子序列 )
- POJ 2533 Longest Ordered Subsequence (最长上升子序列 DP优化)
- Poj 2533-Longest Ordered Subsequence(最长有序子序列)
- poj 2533:Longest Ordered Subsequence 求最长递增序列长度
- POJ 2533--Longest Ordered Subsequence【最长递增子序列 + 二分优化】
- POJ 2533 Longest Ordered Subsequence(最长上升子序列(NlogN)
- POJ 2533 Longest Ordered Subsequence (DP,最长递增序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列(NlogN)
- POJ 3903-Stock Exchange/POJ 2533-Longest Ordered Subsequence(LIS-最长递增子序列长度)