hdu 1087 Super Jumping! Jumping! Jumping! DP
来源:互联网 发布:大数据下的机械工程 编辑:程序博客网 时间:2024/03/28 18:33
简单的递增数列最大和
dp[i]保存以i为结尾的递增数列最大和
于是有dp[i] = max(dp[i], dp[j]+a[i]);
#include <iostream>using namespace std;#define N 1005int a[N],dp[N];int main(){int n;while(cin >> n){if(n==0)break;for(int i=0; i<n; i++){cin >> a[i];dp[i] = a[i];}int max = a[0];for(int i=1; i<n; i++){for(int j=0; j<i; j++){if(a[i]>a[j] && a[i]+dp[j]>dp[i])dp[i] = a[i] + dp[j];}if(max < dp[i])max = dp[i];}cout << max << endl;}return 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!(dp)
- Super Jumping! Jumping! Jumping! -HDU 1087 dp
- 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)
- [HDU 1087 Super Jumping! Jumping! Jumping!] DP
- DP-HDU-1087-Super Jumping!Jumping!Jumping!
- HDU-1087-DP-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】
- HDU-1087 Super Jumping! Jumping! Jumping! (DP)
- HDU-1087 Super Jumping! Jumping! Jumping!(DP)
- linux中断机制及中断注册1(韦东山的视频总结及针对linux-2.6.30.4)
- CxImage合并图片(网络修改版)
- 各种排序算法
- 组函数的使用小结
- 使用C指针颠倒字符串
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- windows下使用makefile
- Java多线程(二)、启动一个线程的3种方式
- DMM(数字万用表)精度5位半和6位半的涵义是什么?
- 排序(插入排序、希尔排序、堆排序、归并排序、快速排序法)
- GridView使用示例(三)
- 倒排索引
- HDU4548(模拟)
- NSIS:制作C#应用程序安装包