简单的dp,最优子结构是dp[i],即从0~i来看,是的dp[i]最大,然后找到最大中的最大就可以了,

转移方程是:dp[i]=max{dp[i],dp[j]+value[i]},注意这里有两个判断条件。

#include"iostream"
#include"stdio.h"
#include"string.h"
#include"algorithm"
#define mx 1010
using namespace std;
__int64 n;
__int64 value[mx];
__int64 dp[mx];
int main()
{__int64 i,j,ans;while(cin>>n,n){for(i=1;i<=n;i++)cin>>value[i];memset(dp,0,sizeof(dp));value[0]=0;ans=0;for(i=1;i<=n;i++){for(j=0;j<i;j++){if(value[j]<value[i]){if(dp[j]+value[i]>dp[i]) dp[i]=dp[j]+value[i];if(dp[i]>ans) ans=dp[i];}}}cout<<ans<<endl;}return 0;
}

View Code

转载于:https://www.cnblogs.com/acm-jing/p/4410345.html

hdu Super Jumping相关推荐

  1. HDU OJ Super Jumping! Jumping! Jumping!

    Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K ...

  2. hdu 1087 Super Jumping! Jumping! Jumping!

    Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!" is very popular i ...

  3. hdu 1087 Super Jumping! Jumping! Jumping! 动态规划

    Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K ...

  4. DP专题训练之HDU 1087 Super Jumping!

    Description Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!" is ve ...

  5. Super Jumping! Jumping! Jumping! HDU - 1087

    Super Jumping! Jumping! Jumping! HDU - 1087 题意: 给定一条长度为n的序列,其中一定存在一条元素和最大的严格上升子序列,求这条序列的元素和. 题解: 最长上 ...

  6. 动态规划训练17 [Super Jumping! Jumping! Jumping! HDU - 1087 ]

    Super Jumping! Jumping! Jumping! HDU - 1087 过于简单懒得说了 #include <cstdio> #include <algorithm& ...

  7. hdu 1087 Super Jumping! Jumping! Jumping!

    Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!" is very popular i ...

  8. 【HDU - 1087】Super Jumping! Jumping! Jumping! (最大上升子序列类问题,dp)

    题干: Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!" is very popul ...

  9. HDU 1087 Super Jumping! Jumping! Jumping!【最大递增子段和】

    Problem Description Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!&quo ...

最新文章

  1. 模板网站建设究竟有哪些优势?
  2. php 获取指定时间 次日,PHP时间判断语句
  3. linux centos/redhat mysql8.0安装(汇总贴)
  4. STF简单修改实现安卓多机同屏控制
  5. 【BZOJ3191】卡牌游戏,概率DP
  6. python互斥锁原理_Linux 互斥锁的实现原理(pthread_mutex_t)
  7. 两种数据仓库分层实例
  8. linux 看rabbit版本,Linux下安装rabbitMq
  9. 程序员相亲图鉴,太真实了!
  10. Unity中使用Curvy快速生成路径,并使物体沿着路线运动
  11. 3D模型在线转换,CAD格式转换,Solidworks版本转换
  12. 2022年11月份,NPDP产品经理认证即将改版,到底改哪些内容?
  13. 郭盛华为什么不去阿里巴巴?原因竟是这个
  14. A fastandrobust convolutionalneuralnetwork-based defect detection model inproductqualitycontrol-阅读笔记
  15. UWP 动画系列之模仿网易云音乐动画
  16. 可在WPS环境中通用的vb6代码修改方法
  17. 上拉电阻和下拉电阻判断
  18. 四则运算算法实现(java)
  19. 元宇宙是个什么样的概念?
  20. Semantic Kernel 入门系列

热门文章

  1. cocos2d-x中的尺寸之一
  2. Vue简单入门及组件的简单使用
  3. BCGControlBar教程:可视化管理器
  4. InfluxDB Cli中查询结果中time格式显示设置
  5. iOS - Swift NSUserDefaults 数据存储
  6. 20145129 《Java程序设计》第3周学习总结
  7. Codeforces 484E Sign on Fence(是持久的段树+二分法)
  8. Jar运行的几个方法
  9. java 抽象属性_怎样在java中定义一个抽象属性
  10. java连接oftp_[Share] EDI 系统之 OFTP 端口