HDU 1087 Super Jumping! Jumping! Jumping!
2012-03-28 21:08
162 查看
另一动态规划基本题型,LIS...
题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=1087
代码如下:
题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=1087
代码如下:
#include <stdio.h> int n; int max; int num[1000005]; int dp[1000005]; void d_p() { max = dp[0]; for( int i = 0; i < n; i++ ) { for( int j = 0; j < i; j++ ) if( num[j]<num[i] && dp[i]<dp[j]+num[i] ) dp[i] = dp[j]+num[i]; if( max < dp[i] ) max = dp[i]; } } int main() { while( scanf( "%d", &n ), n ) { for( int i = 0; i < n; i++ ) { scanf("%d",&num[i]); dp[i] = num[i]; } d_p(); printf("%d\n",max); } return 0; }
相关文章推荐
- HDU-1087(Super Jumping! Jumping! Jumping!)(LCS)
- 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!_dp
- 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!
- 【最长上升子序列】HDU 1087——Super Jumping! Jumping! Jumping!
- Problem C:Super Jumping! Jumping! Jumping!(HDU 1087)
- HDU 1087 Super Jumping! Jumping! Jumping!
- Hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! (LIS)
- hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!(简单dp)
- [简单DP]Super Jumping! Jumping! Jumping! HDU - 1087
- hdu 1087 Super Jumping! Jumping! Jumping! ----dp
- hdu - 1087 - Super Jumping! Jumping! Jumping!