HDU 1087 Super Jumping! Jumping! Jumping!
2014-11-02 22:28
387 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1087
最大递增子序列,不需要连续。能跳到i的条件是i>j && num[i] > num[j]。
http://acm.hdu.edu.cn/showproblem.php?pid=1087
最大递增子序列,不需要连续。能跳到i的条件是i>j && num[i] > num[j]。
#include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> using namespace std; const int N = 1010; int dp ,num ; int main(){ // freopen("in.txt", "r", stdin); int n; while(scanf("%d",&n) != EOF && n){ for(int i=1; i<=n; i++) scanf("%d",&num[i]); memset(dp, 0, sizeof(dp)); for(int i=1; i<=n; i++) for(int j=0; j<i; j++) if(num[i] > num[j]) dp[i] = max(dp[i], dp[j] + num[i]); int ans = 0; for(int i=1; i<=n; i++) ans = max(ans, dp[i]); printf("%d\n",ans); } return 0; }
相关文章推荐
- Super Jumping! Jumping! Jumping! HDU - 1087
- hdu 1087 Super Jumping! Jumping! Jumping!(LIS变形题,求上升子序列的最大和)
- 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)
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU - 1087 Super Jumping! Jumping! Jumping!
- HDU1087--Super Jumping! Jumping! Jumping! (DP动态规划最大上升子序列的和)
- 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!
- 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! (LIS 最大上升子序列)
- hdu1087 Super Jumping! Jumping! Jumping!