hdu 1087 Super Jumping! Jumping! Jumping!-dp 最长上升子序列和
2015-04-26 22:05
453 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1087
水水DP!
水水DP!
#include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> #include <iostream> #include <algorithm> using namespace std; int a[1010],dp[1010]; int main() { int n; while(~scanf("%d",&n),n) { memset(a,0,sizeof(a)); memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } for(int i=1;i<=n;i++) { for(int j=i-1;j>=0;j--) { if(a[i]>a[j]) dp[i]=max(dp[i],a[i]+dp[j]); } } sort(dp+1,dp+1+n); printf("%d\n",dp ); } return 0; }
相关文章推荐
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)
- hdu 1087 Super Jumping! Jumping! Jumping!(最长上升子序列&dp)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)
- HDU 1087 Super Jumping! Jumping! Jumping!(dp最长上升子序列的和)
- HDU-1087 Super Jumping! Jumping! Jumping! 最长上升子序列
- (hdu step 3.2.3)Super Jumping! Jumping! Jumping!(DP:求最长上升子序列的最大和)
- HDU 1087 Super Jumping! Jumping! Jumping!【最长上升子序列元素总和】
- HDU 1087 Super Jumping! Jumping! Jumping!最长上升子序列
- HDU 1087 Super Jumping! Jumping! Jumping! (线性dp 最大上升子序列)
- HDU 1087 Super Jumping! Jumping! Jumping!(最大的上升子序列的和)(不是最长)(易混淆)
- HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列和)
- HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列求和)【最长序列求和类模板】
- Super Jumping! Jumping! Jumping! HDU - 1087 (最长上升子序列之和)
- HDU 1087 Super Jumping! Jumping! Jumping!(DP,上升子序列)
- HDU 1087 Super Jumping! Jumping! Jumping! --- DP入门之最大上升子序列
- hdu 1087 Super Jumping! Jumping! Jumping!(基础DP,最大上升子序列和)
- hdu 1087 Super Jumping! Jumping! Jumping! (最大 上升子序列 线性 dp)
- HDU 1087 Super Jumping! Jumping! Jumping!(最长上升子序列,dp)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp+最长递增序列)
- HDU1087--Super Jumping! Jumping! Jumping! (DP动态规划最大上升子序列的和)