HDU - 1087 Super Jumping! Jumping! Jumping!(最长递增子序列)
2017-08-31 16:41
423 查看
题目大意:棋子要从 star 跳到 end,每个位置都有一个值,要求每次移动时值都递增,且不能返回,把 star 看作无穷小, end 看作无穷大,输出最大和。
解题思路:LIS 水过 dp 记录到达当前位置时最大和
解题思路:LIS 水过 dp 记录到达当前位置时最大和
#include<iostream> #include<stdio.h> #include<algorithm> #include<cmath> #include<string.h> #include<string> #include<queue> #include<map> #define max(a,b) ((a)>(b)?(a):(b)) #define min(a,b) ((a)<(b)?(a):(b)) const int INF = 0x3f3f3f3f; const int NINF = -INF -1; const int MAXN = 1000+5; using namespace std; int num[MAXN], dp[MAXN]; int n, ans; int main() { while (scanf("%d", &n) && n) { memset(dp, 0, sizeof(dp)); for (int i = 0; i < n; i++) scanf("%d", &num[i]); dp[0] = num[0]; ans = 0; for (int i = 1; i < n; i++) { dp[i] = num[i]; for (int j = 0; j < i; j++) if (num[j] < num[i]) dp[i] = max(dp[j]+num[i], dp[i]); // printf("%d %d\n", i, dp[i]); if (dp[i] > ans) ans = dp[i]; } printf("%d\n", ans); } return 0; }
相关文章推荐
- 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!(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! (动态规划,求最长子序列之和)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp+最长递增序列)
- Super Jumping! Jumping! Jumping! 【hdu-1087】【动态规划-最长上升子序列】
- hdu 1087 Super Jumping! Jumping! Jumping!(上升子序列最大和)
- HDU1087--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!(dp:上升子序列最大和)
- HDU1087 Super Jumping! Jumping! Jumping! DP求非连续单调递增序列的最大和
- HDU 1087 Super Jumping! Jumping! Jumping! 最大连续子序列和
- 【最长上升子序列】HDU 1087——Super Jumping! Jumping! Jumping!