Longest Ordered Subsequence POJ - 2533 【经典DP】
2018-01-23 19:42
519 查看
题意:最长上升子序列
思路:dp[i]={a[1~i-1]中比a[i]小的 && dp最大值}
居然WA了4次Σ( ° △ °|||)︴ 原来初始化出问题了啊。。。
思路:dp[i]={a[1~i-1]中比a[i]小的 && dp最大值}
居然WA了4次Σ( ° △ °|||)︴ 原来初始化出问题了啊。。。
#include <stdio.h> #include <iostream> using namespace std; typedef long long ll; const int N=1e5+3; int a ; int dp ; int main(void){ int n; while(cin >> n){ for(int i=1;i<=n;i++) scanf("%d",&a[i]); for(int i=1;i<=n;i++) dp[i]=1; for(int i=2;i<=n;i++){ int dpmax=-1,index=-1; for(int j=1;j<i;j++){ if(a[j]<a[i] && dp[j]>dpmax) dpmax=dp[j],index=j; } if(index!=-1) dp[i]=dp[index]+1; } int mmax=-1; //for(int i=1;i<=n;i++) printf("%d ",dp[i]); for(int i=1;i<=n;i++){ mmax=max(mmax,dp[i]); } cout << mmax << endl; } }
相关文章推荐
- poj 2533 Longest Ordered Subsequence 经典DP
- POJ 2533-Longest Ordered Subsequence(dp_最长上升子序列)
- poj 2533 Longest Ordered Subsequence(dp)
- POJ-2533 Longest Ordered Subsequence ( DP )
- POJ 2533 Longest Ordered Subsequence (最长上升子序列 DP优化)
- POJ 2533-Longest Ordered Subsequence(DP)
- POJ 2533 Longest Ordered Subsequence(最长路径 dp)
- POJ 2533-Longest Ordered Subsequence(DP)
- poj 动态规划DP - 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence(dp)
- POJ 2533 Longest Ordered Subsequence DP(LIS)
- POJ 2533-Longest Ordered Subsequence(DP:LIS)
- POJ 2533 Longest Ordered Subsequence (DP动态规划)
- Longest Ordered Subsequence POJ - 2533(dp动态规划)
- poj入门水题--动态规划(DP)2533 Longest Ordered Subsequence 1088滑雪
- POJ 2533 Longest Ordered Subsequence(基础DP)
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(dp LIS)
- 【dp-LIS】牛客网 --最长上升子序列 POJ 2533--Longest Ordered Subsequence(LIS模板题)
- POJ 2533 Longest Ordered Subsequence【最长递增子序列】【DP思想】