hdu——1087——Super Jumping! Jumping! Jumping!
2013-03-26 16:46
267 查看
地址:http://acm.hdu.edu.cn/showproblem.php?pid=1087
求出最长上升子序列的和
求出最长上升子序列的和
#include <iostream> #include <stdio.h> #include <string.h> using namespace std; int a[1010],dp[1010]; int main() { int i,j,n,m,k; while(scanf("%d",&n)) { if(n==0) break; for(i=0;i<n;i++) scanf("%d",&a[i]); memset(dp,0,sizeof(dp)); dp[0]=a[0]; int Max=-0xffff; for(i=1;i<n;i++) { dp[i]=a[i]; for(j=0;j<i;j++) { if(a[j]<a[i] && dp[j]+a[i]>dp[i]) dp[i]=dp[j]+a[i]; } if(Max<dp[i]) Max=dp[i]; } printf("%d\n",Max); } return 0; }
相关文章推荐
- hdu 1087 Super Jumping! Jumping! Jumping!(水~dp)
- Hdu 1087 Super Jumping! Jumping! Jumping!【最大上升子序列和】
- HDU1087--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!
- 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!(DP,LIS问题)
- 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!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU-1087 Super Jumping! Jumping! Jumping!(LIS)
- HDU 1087 Super Jumping! Jumping! Jumping! (最长上升子序列和)