HDU ACM 1087Super Jumping! Jumping! Jumping!->DP(动态规划)
来源:互联网 发布:有个性淘宝店头像图片 编辑:程序博客网 时间:2024/06/06 04:10
分析:简单DP,转移方程dp[j]=max{dp[i]}+a[j];(0<=i<j<n,a[i]<a[j])。
#include<iostream>using namespace std;__int64 dp[1001];int a[1001];int main(){int i,n,j;__int64 max;while(cin>>n && n){for(i=0;i<n;i++)cin>>a[i];max=0x7fffffffffffffff+1;for(i=0;i<n;i++){dp[i]=a[i];max=max>dp[i]?max:dp[i];for(j=0;j<i;j++)if(a[i]>a[j])if(dp[i]<dp[j]+a[i]){dp[i]=dp[j]+a[i];max=max>dp[i]?max:dp[i];}}printf("%I64d\n",max);} return 0;}
0 0
- [ACM] hdu 1087 Super Jumping! Jumping! Jumping! (动态规划)
- hdu 1087 Super Jumping! Jumping! Jumping!(动态规划DP)
- HDU ACM 1087Super 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! (动态规划)
- 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!(动态规划)
- 动态规划HDU-1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- pw Android笔试面试题(含java)
- 使用grep查找文件中指定字符出现的次数
- jtable——A JQuery plugin to create AJAX based CRUD tables
- 根据IP获取地理位置
- B/S客户端和服务端进行数据校验的原因和必要性
- HDU ACM 1087Super Jumping! Jumping! Jumping!->DP(动态规划)
- 什么是框架,框架的作用是什么?
- hibernate 三种状态详解
- ios 定位
- .NET基础教程--简介
- SQL 数据库语言分析总结(三)
- listview添加footerview
- oracle的查询语句中判断字符是否是全数字
- 查询mysql事务隔离级别