hdu Super Jumping! Jumping! Jumping!
来源:互联网 发布:macd算法 编辑:程序博客网 时间:2024/05/18 08:01
题意:
从一个点,一直跳,下一步只能够跳到比当前最大的,(就是与最长子序列差不多(可不连续的)。
限制与要求:
多组测试,以零结束。
分析:
状态转移方程。
dp[i]=max(dp[i],dp[j]+a[i]),0<j<i;
#include<stdio.h>#include<string.h>int max(int a,int b){ return a>b?a:b;}int dp[100010];int main(){ int n,i,j; int ans,a[100010]; while(scanf("%d",&n)!=EOF,n) { memset(dp,0,sizeof(dp)); for(i=0;i<n;i++) { scanf("%d",&a[i]); dp[i]=a[i]; } for(i=0;i<n;i++) for(j=0;j<=i;j++) if(a[j]<a[i]) dp[i]=max(dp[i],dp[j]+a[i]); ans=-1000; for(i=0;i<n;i++) if(dp[i]>ans) ans=dp[i]; printf("%d\n",ans); } return 0;}
- HDU Super Jumping! Jumping! Jumping!
- hdu Super Jumping! Jumping! Jumping!
- hdu Super Jumping! Jumping! Jumping!
- hdu Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- eclipse老是building workspace及自动更新问题,eclipse加速
- C语言实现的OOP
- MFC 打开外部文件 WinExec,ShellExecute ,CreateProcess
- LNMP环境的搭建配置(CentOS6.2+nginx1.1.15+mysql5.6+php5.3.10)
- UVA 11078 Open Credit System
- hdu Super Jumping! Jumping! Jumping!
- 用两个栈实现一个队列:实现出队列和入队列功能,用两个队列实现一个栈
- C语言的条件编译
- iOS 开发之Target
- MySQL存储引擎比较
- java中newInstance()和new()
- java笔记第四节
- 用.NET MVC实现长轮询,与jQuery.AJAX即时双向通信
- O(n^2)-time Algorithm to OPTIMAL-BST Question