HDU1087 Super Jumping! Jumping! Jumping! 动态规划
来源:互联网 发布:拍视频特效软件 编辑:程序博客网 时间:2024/04/28 04:57
动态规划
本题其实就是求一个序列的最长上升子序列,状态转移方程为:dp【i】=max(dp【i】,dp【j】+ans【i】)
#include <cstdio>#include <iostream>#define MAX 1100using namespace std;int main(){ int ans[MAX],dp[MAX]; int n,i; while(scanf("%d",&n)&&n) { for(i=0;i<n;i++) scanf("%d",&ans[i]); for(i=0;i<n;i++) dp[i]=ans[i]; int temp=ans[0]; for(i=0;i<n;i++) { for(int j=0;j<=i;j++) if(ans[i]>ans[j]) dp[i]=max(dp[i],dp[j]+ans[i]); temp=max(temp,dp[i]); } printf("%d\n",temp); } return 0;}
0 0
- HDU1087 Super Jumping! Jumping! Jumping! 动态规划
- hdu1087 Super Jumping! Jumping! Jumping!(简单动态规划)
- Hdu1087-Super Jumping! Jumping! Jumping!-【dp动态规划】
- Super Jumping! Jumping! Jumping!(HDU1087)
- hdu1087 Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- HDU1087--Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!(HDU1087)
- hdu1087-Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- HDU1087 Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- HDU1087----Super Jumping! Jumping! Jumping!
- HDU1087 Super Jumping! Jumping! Jumping!
- hdu1087---Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- hdu1087 Super Jumping! Jumping! Jumping!
- 【HDU1087】【Super Jumping! Jumping! Jumping!】
- 运营商在C + +
- Ubuntu 12.04 LTS 网络配置要点
- Lua xml解析与更新的函数(二)
- C/C++常用时间函数介绍
- 数棋盘
- HDU1087 Super Jumping! Jumping! Jumping! 动态规划
- 使用3QVPN 快速布置一个VPN
- Java多线程编程实战精要(1)
- 入股合肥三洋,惠而浦携四大品牌通吃家电市场
- 漫谈CSS和页面布局
- PHP验证码不显示问题
- HDU 3488 Tour(KM完美匹配)
- 退出整个Android 应用的方法
- PAT 1014. Waiting in Line (30)