HDU 1087 Super Jumping! Jumping! Jumping! 上升序列最大和+DP .
2016-09-25 11:40
369 查看
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1087
水题
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1000+5;
int d[maxn],n[maxn];
//d[i] 表示前i个上升子序列的最大和
int main()
{
int N;
while(cin>>N,N)
{
for(int i=0;i<N;i++){
scanf("%d",&n[i]);
d[i]=n[i];
for(int j=0;j<i;j++)
if(n[j]<n[i]) d[i]=max(d[j]+n[i],d[i]);
}
cout<<*max_element(d,d+N)<<endl;
}
return 0;
}
水题
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1000+5;
int d[maxn],n[maxn];
//d[i] 表示前i个上升子序列的最大和
int main()
{
int N;
while(cin>>N,N)
{
for(int i=0;i<N;i++){
scanf("%d",&n[i]);
d[i]=n[i];
for(int j=0;j<i;j++)
if(n[j]<n[i]) d[i]=max(d[j]+n[i],d[i]);
}
cout<<*max_element(d,d+N)<<endl;
}
return 0;
}
相关文章推荐
- 【最长上升子序列】HDU 1087——Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! 最长上升子序列的变形
- HDU1087--Super Jumping! Jumping! Jumping! (DP动态规划最大上升子序列的和)
- 【最长上升子序列】HDU 1087——Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!(最长上升子序列,dp)
- hdu 1087 Super Jumping! Jumping! Jumping! ( 求序列的最大上升序列 )
- Super Jumping! Jumping! Jumping! 【hdu-1087】【动态规划-最长上升子序列】
- 【最长上升子序列】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:上升子序列最大和)
- HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列求和)【最长序列求和类模板】
- HDU 1087 Super Jumping! Jumping! Jumping!【最长上升子序列元素总和】
- HDU 1087 Super Jumping! Jumping! Jumping! (求最大上升子序列和,动态规划)
- Super Jumping! Jumping! Jumping! HDU - 1087(dp,上升子串求最大和)
- Super Jumping! Jumping! Jumping! HDU - 1087 (最长上升子序列之和)
- hdoj1087Super Jumping! Jumping! Jumping!(上升序列求最大和)
- HDU 1087 Super Jumping!Jumping!Jumping求连续上升子序列的最大和值 (解析)
- HDU 1087 Super Jumping! Jumping! Jumping! 最大连续子序列和
- HDU 1087--Super Jumping! Jumping! Jumping!【最长递增子序列的和】