hdu 1087 Super Jumping! Jumping! Jumping!(动态规划DP)
来源:互联网 发布:linux修改host科学上网 编辑:程序博客网 时间:2024/06/15 10:01
题意:
在序列中任意选择一个起点,使得其上升序列之和最大。
思路:
跟(hdu1069--猴子摘香蕉)是一样的,只要后一个数字比前一个数字大就可以尝试累加,最后输出dp数组中的最大值即可。
hdu1069--猴子摘香蕉的题解:http://blog.csdn.net/qq_37325947/article/details/77108288
#include<iostream>#include<cstdio>#include<algorithm> using namespace std;int dp[1500],en[1500];int main(){int n;while(scanf("%d",&n)&&n){for(int i=0;i<n;i++)scanf("%d",&en[i]);for(int i=0;i<n;i++){dp[i]=en[i]; for(int j=i-1;j>=0;j--)if(en[i]>en[j]){dp[i]=max(dp[i],en[i]+dp[j]);} }int mx=dp[0];for(int i=0;i<n;i++)if(dp[i]>mx) mx=dp[i];printf("%d\n",mx);}return 0;}
阅读全文
0 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!(动态规划)
- hdu 1087 Super Jumping! Jumping! Jumping! 动态规划
- HDU 1087 Super Jumping! Jumping! Jumping! -- 简单动态规划
- hdu 1087 Super Jumping! Jumping! Jumping! (动态规划)
- [ACM] 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-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! ----dp
- HDU 1087 Super Jumping! Jumping! Jumping!(dp)
- 阿里巴巴Java开发手册v1.2.0网页版
- springmvc+kindeditor使用
- Java-反射机制详解
- 软件需求工程
- Cookie工具类
- hdu 1087 Super Jumping! Jumping! Jumping!(动态规划DP)
- PHP命名空间(Namespace)的使用详解
- 去除steamvr中script自带的图标
- 笔记,通用mapper
- hdu2844 多重背包
- Defense Lines UVA
- UVA
- POJ3461【1e6 字符串 hash模板】
- oracle插入多条语句(转载的)