HDU 1087 Super Jumping! Jumping! Jumping!
2012-09-14 19:17
316 查看
#include<stdio.h>
#include<string.h>
int main()
{
int i,j,a[1000],n,temp,s[1000],max;
while(scanf("%d",&n)!=EOF && n)
{
for(i=0;i<n;i++) scanf("%d",&a[i]);
max=0;
memset(s,0,sizeof(s));
for(i=0;i<n;i++){
temp=0; // 到 j 个数时的最大解
for(j=0;j<i;j++){
if(a[i]>a[j]){
if(s[j]>temp)
temp=s[j];
}
}
s[i]+=a[i]+temp;
if(max<s[i]) max=s[i];
}
printf("%d\n",max);
}
return 0;
}
#include<string.h>
int main()
{
int i,j,a[1000],n,temp,s[1000],max;
while(scanf("%d",&n)!=EOF && n)
{
for(i=0;i<n;i++) scanf("%d",&a[i]);
max=0;
memset(s,0,sizeof(s));
for(i=0;i<n;i++){
temp=0; // 到 j 个数时的最大解
for(j=0;j<i;j++){
if(a[i]>a[j]){
if(s[j]>temp)
temp=s[j];
}
}
s[i]+=a[i]+temp;
if(max<s[i]) max=s[i];
}
printf("%d\n",max);
}
return 0;
}
相关文章推荐
- HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列求和)【最长序列求和类模板】
- hdu 1087 解题报告 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping! 动态规划
- HDU 1087 Super Jumping! Jumping! Jumping! && 1114 Piggy-Bank 简单dp
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU-1087Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! 最长上升子序列的变形
- HDU 1087 Super Jumping! Jumping! Jumping!
- [ACM] hdu 1087 Super Jumping! Jumping! Jumping! (动态规划)
- 【hdu - 1087 (Super Jumping! Jumping! Jumping!) -- 巨水动规题,,被坑!!】
- hdu 1087 Super Jumping! Jumping! Jumping!
- 【HDU】1087 - Super Jumping! Jumping! Jumping!(dp)
- Super Jumping! Jumping! Jumping! HDU - 1087(dp,上升子串求最大和)
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!(动态规划)
- hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! 动态规划
- hdu 1087 Super Jumping! Jumping! Jumping!(动态规划DP)
- HDU 1087Super Jumping! Jumping! Jumping! —简单DP
- hdu 1087 Super Jumping! Jumping! Jumping! 简单的dp