HDU 1087 Super Jumping! Jumping! Jumping!(dp最长上升子序列的和)
2016-09-09 09:37
447 查看
f[i]=max(f[i],f[j]+d[i])。
//
// main.cpp
// Richard
//
// Created by 邵金杰 on 16/9/9.
// Copyright © 2016年 邵金杰. All rights reserved.
//
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1000+10;
typedef long long ll;
ll f[maxn];
int d[maxn];
int main()
{
int n;
while(scanf("%d",&n)&&n)
{
for(int i=0;i<n;i++){
scanf("%d",&d[i]);
f[i]=d[i];
}
for(int i=0;i<n;i++)
{
for(int j=0;j<i;j++)
{
if(d[i]>d[j]) f[i]=max(f[i],f[j]+d[i]);
}
}
sort(f,f+n);
cout<<f[n-1]<<endl;
}
return 0;
}
//
// main.cpp
// Richard
//
// Created by 邵金杰 on 16/9/9.
// Copyright © 2016年 邵金杰. All rights reserved.
//
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1000+10;
typedef long long ll;
ll f[maxn];
int d[maxn];
int main()
{
int n;
while(scanf("%d",&n)&&n)
{
for(int i=0;i<n;i++){
scanf("%d",&d[i]);
f[i]=d[i];
}
for(int i=0;i<n;i++)
{
for(int j=0;j<i;j++)
{
if(d[i]>d[j]) f[i]=max(f[i],f[j]+d[i]);
}
}
sort(f,f+n);
cout<<f[n-1]<<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 最长上升子序列和)
- 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 step 3.2.3)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!(最大的上升子序列的和)(不是最长)(易混淆)
- 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! --- DP入门之最大上升子序列
- Super Jumping! Jumping! Jumping! HDU - 1087 (最长上升子序列之和)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp+最长递增序列)
- hdu 1087 Super Jumping! Jumping! Jumping!(LIS变形题,求上升子序列的最大和)