hdu 1087 最大递增和

思路和LIS差不多，dp[i]为i结尾最大值

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define debug printf("!\n")
#define MAXN 205
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue
#define INF 0x3f3f3f3fint n,m;int dp[1005],v[1005];int main()
{int i,j,k,a,b,kase=0;while(~sf("%d",&n) && n){mem(dp,0);mem(v,0);int ans = 0;for(i=0;i<n;i++){sf("%d",&v[i]);dp[i] = v[i];ans = max(ans,dp[i]);}for(i=1;i<n;i++){for(j=0;j<i;j++){if(dp[i]>dp[j]){dp[i] = max(dp[i],dp[j]+v[i]);ans = max(dp[i],ans);}}}pf("%d\n",ans);}return 0;
}

转载于:https://www.cnblogs.com/qlky/p/5661972.html

hdu 1087 最大递增和相关推荐

动态规划百题第六题 HDU - 1087
动态规划百题计划又重新开始啦 6: E - Super Jumping! Jumping! Jumping! HDU - 1087 wsw成功的在zzq的帮助下获得了与小姐姐约会的机会,同时也不用担心 ...
Super Jumping! Jumping! Jumping! HDU - 1087
Super Jumping! Jumping! Jumping! HDU - 1087 题意: 给定一条长度为n的序列,其中一定存在一条元素和最大的严格上升子序列,求这条序列的元素和. 题解: 最长上 ...
动态规划训练17 [Super Jumping! Jumping! Jumping! HDU - 1087 ]
Super Jumping! Jumping! Jumping! HDU - 1087 过于简单懒得说了 #include <cstdio> #include <algorithm& ...
HDU 1087 Super Jumping! Jumping! Jumping!【最大递增子段和】
Problem Description Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!&quo ...
hdu - 1087 - Super Jumping! Jumping! Jumping!
题意:求最大升序和. 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087 -->>设d[i]表示以第i个数为终点的最大升序和,然后从第1 ...
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!
Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!" is very popular i ...
【HDU - 1087】Super Jumping! Jumping! Jumping! （最大上升子序列类问题，dp）
题干: Nowadays, a kind of chess game called "Super Jumping! Jumping! Jumping!" is very popul ...

hdu 1087 最大递增和

hdu 1087 最大递增和相关推荐

最新文章

热门文章