动态规划训练17 [Super Jumping! Jumping! Jumping! HDU

Super Jumping! Jumping! Jumping!

HDU - 1087

过于简单懒得说了

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX = 1000;
int a[MAX];
int dp[MAX];
main(){int N;while(scanf("%d",&N) != EOF && N){for(int i = 0;i < N;i++){scanf("%d",&a[i]);}int ans = 0;for(int i = 0;i < N;i++){dp[i] = a[i];for(int j = 0;j < i;j++){if(a[i] > a[j])dp[i] = max(dp[i],dp[j] + a[i]);}ans = max(ans,dp[i]);}printf("%d\n",ans);}return 0;
}

动态规划训练17 [Super Jumping! Jumping! Jumping! HDU - 1087 ]相关推荐

动态规划训练14 [Max Sum Plus Plus HDU - 1024 ]
Max Sum Plus Plus HDU - 1024 题意大致是说给你你个序列,把它划分成不相交的几个连续的部分,然后把这个几个部分求和,求出和的最大值. 我们定义子结构 dp[i][j] 表 ...
Super Jumping! Jumping! Jumping! HDU - 1087
Super Jumping! Jumping! Jumping! HDU - 1087 题意: 给定一条长度为n的序列,其中一定存在一条元素和最大的严格上升子序列,求这条序列的元素和. 题解: 最长上 ...
动态规划百题第六题 HDU - 1087
动态规划百题计划又重新开始啦 6: E - Super Jumping! Jumping! Jumping! HDU - 1087 wsw成功的在zzq的帮助下获得了与小姐姐约会的机会,同时也不用担心 ...
Java企业面试算法新得体会之4递归和动态规划问题17问
递归和动态规划问题17问题目真的难,好些题,一点头绪都没有 12月3号
hdu 1087 Super Jumping! Jumping! Jumping! 动态规划
Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K ...
DP专题训练之HDU 1087 Super Jumping!
Description Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!" is ve ...
HDU 1087 [Super Jumping! Jumping! Jumping!]动态规划
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087 题目大意:有N个格子,每个格子有数值.从原点开始跳,可以跳到任何一个位置:在某一个位置,只能跳到 ...
【HDU - 1087】Super Jumping! Jumping! Jumping! （最大上升子序列类问题，dp）
题干: Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!" is very popul ...
hdu 1087 Super Jumping! Jumping! Jumping!
Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!" is very popular i ...

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

Super Jumping! Jumping! Jumping!

动态规划训练17 [Super Jumping! Jumping! Jumping! HDU - 1087 ]相关推荐

最新文章

热门文章