hdu 1087 Super Jumping! Jumping! Jumping! 动态规划
来源:互联网 发布:域名备案密码有什么用 编辑:程序博客网 时间:2024/06/05 06:30
题意:求n个点的和最大上升子序列。
简单题,d[i]=max(d[j]+a[i]),(j<i且a[j]<a[i]),求最大的d[i]得解。
#include <iostream>#include<cstdio>#include<cmath>#define N 1100using namespace std;int d[N],a[N];int main(){ int n; while(scanf("%d",&n)&&n) { for(int i=1;i<=n;i++) scanf("%d",&a[i]),d[i]=a[i]; int ans=0; for(int i=1;i<=n;i++) { for(int j=1;j<i;j++) if(a[j]<a[i]) d[i]=max(d[i],d[j]+a[i]); ans=max(d[i],ans); } cout<<ans<<endl; }}
0 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! (动态规划)
- [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!(动态规划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!
- 【HDU 1087】Super Jumping! Jumping! Jumping! (dp动态规划)
- hdu 1087 Super Jumping! Jumping! Jumping!(动态规划DP)
- 动态规划训练17 [Super Jumping! Jumping! Jumping! HDU
- HDU1087 Super Jumping! Jumping! Jumping! 动态规划
- Super Jumping! Jumping! Jumping!(动态规划)
- 动态规划 Super Jumping! Jumping! Jumping!
- Android 最火的快速开发框架XUtils
- 4296: [PA2015]Mistrzostwa|图的联通
- cmd中乱码暂时解决
- Druid连接池简单入门配置
- 【poj1821】Fence 单调队列优化DP
- hdu 1087 Super Jumping! Jumping! Jumping! 动态规划
- MediaPlayer
- 应用程序权限设计
- JAVA反射原理
- 用RxJava.Observable取代AsyncTask和AsyncTaskLoader-RxJava Android模版
- 启动activity时,有个一闪而过界面
- jersey的测试
- oracle归档日志满所引发的问题及解决
- The sandbox is not sync with the Podfile.lock问题解决方案