hdu1087 Super Jumping! Jumping! Jumping!
2012-08-10 18:49
411 查看
#include<stdio.h> #include<string.h> #include<stdlib.h> #include<math.h> #include<algorithm> using namespace std; int n; long a[1010]; long d[1010];// int main() { while(scanf("%d",&n),n) { int i,j; for(i=0;i<n;i++) { scanf("%ld",&a[i]); d[i]=a[i]; } long mmax=d[0]; for(i=1;i<n;i++) { for(j=0;j<i;j++) { if(a[i]>a[j]&&d[j]+a[i]>d[i]) { d[i]=d[j]+a[i]; } } if(mmax<d[i]) { mmax=d[i]; } } printf("%ld\n",mmax); } return 0; }
n^2的复杂度,d[i]记录前i+1个数的最大上升子段的和
相关文章推荐
- HDU-1087-Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU1087 Super Jumping! Jumping! Jumping!
- hdu-1087-Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping! -HDU 1087 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!(DP之LIS)
- 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 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 1087-Super Jumping! Jumping! Jumping!