HDU 1087 Super Jumping! Jumping! Jumping! DP
来源:互联网 发布:凸轮的设计软件 编辑:程序博客网 时间:2024/04/19 21:26
题目大意:给定一段长度为N(N<=1000)序列,在a[i]<a[j]的条件下我们可以从i走到j,可以获得a[j]的分数,问获得的最大分数是多少。
题目分析:可以考虑N^2的DP,类似于LIS问题,把LIS转化为分数即可。
其中DP方程:
dp[i]=max(a[i],dp[j]+a[i]),其中j<i并且a[j]<a[i].
如下代码:
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#define INF 9999999const int MAXN=1001;using namespace std;int dp[MAXN],a[MAXN],n;int main(){while(scanf("%d",&n)!=EOF){if(!n)break;for(int i=1;i<=n;i++)cin>>a[i];dp[1]=a[1];int ans=-INF;for(int i=1;i<=n;i++){dp[i]=a[i];for(int j=1;j<i;j++){if(a[j]<a[i])dp[i]=max(dp[i],dp[j]+a[i]);}ans=max(ans,dp[i]);}cout<<ans<<endl;}//while(1);return 0;}
0 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)
- Super Jumping! Jumping! Jumping! -HDU 1087 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!(DP)
- [HDU 1087 Super Jumping! Jumping! Jumping!] DP
- DP-HDU-1087-Super Jumping!Jumping!Jumping!
- HDU-1087-DP-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
- HDU 1087 Super Jumping! Jumping! Jumping!【dp】
- HDU-1087 Super Jumping! Jumping! Jumping! (DP)
- HDU-1087 Super Jumping! Jumping! Jumping!(DP)
- 新人报道,多多关注
- 求一个字符串中连续出现的次数最多的子串
- hdu1335
- MapBox教程
- "@"在数组、字典中的运用
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- spring context
- kill
- python 实现:题目:有n个人围成一圈,顺序排号。从第一个人开始报数(从1到3报数),凡报到3的人退出圈子,问最后留下的是原来第几号的那位。
- Android的onSaveInstanceState和onRestoreInstanceState用法
- Ehcache详细解读
- 不错啊
- Oracle alter table详解
- HDU 3605 网络流题解