hdu 1087 Super Jumping! Jumping! Jumping!(思想题)
2014-08-03 17:43
288 查看
//hdu 1087Super Jumping! Jumping! Jumping! /* dp[][1]=dp[][0]; 后面归回转移到dp[][1],最后在dp[][1]数组中找答案 */ #include<iostream> #include<cstdio> using namespace std; const int N=1009; int n; int dp [2]; int main() { while(~scanf("%d",&n)) { if(n==0) break; for(int i=1;i<=n;i++) { scanf("%d",&dp[i][0]); dp[i][1]=dp[i][0]; } for(int i=n;i>=2;i--) { for(int j=1;j<=i-1;j++) { if(dp[i][0]>dp[j][0]) { if(dp[j][1]<dp[j][0]+dp[i][1]) { dp[j][1]=dp[j][0]+dp[i][1]; } } } } int ansmax=0; for(int i=1;i<=n;i++) { if(ansmax<dp[i][1]) { ansmax=dp[i][1]; } } printf("%d\n",ansmax); } return 0; }
相关文章推荐
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!【最大递增子段和】
- hdu 1087 Super Jumping! Jumping! Jumping! 解题报告
- hdu 1087 Super Jumping! Jumping! Jumping!
- Hdu 1087 - Super Jumping! Jumping! Jumping!
- HDU-1087Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping! 简单DP
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU-1087(Super Jumping! Jumping! Jumping!)(LCS)
- HDU 1087--Super Jumping! Jumping! Jumping!【最长递增子序列的和】
- HDU 1087 Super Jumping! Jumping! Jumping! 最大子序列的和
- 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!(简单DP)
- 【HDU 1087】Super Jumping! Jumping! Jumping!(最大上升子序列和,动态规划)
- HDU 1087 Super Jumping! Jumping! Jumping!(dp)