hdu 1087 dp(最大递增子序列)
2012-04-14 00:54
375 查看
View Code
#include <stdio.h> #include <string.h> #define N 1005 int dp , num ; int main() { int n; while(scanf("%d", &n), n) { memset(dp, 0, sizeof(dp)); for(int i = 0; i < n; ++i) scanf("%d", &num[i]); int max = 0; for(int i = 0; i < n; ++i) { dp[i] = num[i]; //若从 一开始就跳到 i for(int j = 0; j < i; ++j) { //若从i 之前的点 j 能跳到 i,则记录从 j跳到i 所能达到的最大值 if(num[i] > num[j] && dp[j] + num[i] > dp[i]) dp[i] = dp[j] + num[i]; if(max < dp[i]) //记录最大值 max = dp[i]; } } printf("%d\n", max); } }
相关文章推荐
- HDU 1087 (DP---最大递增子序列和)
- hdu 1087(DP经典最大递增子序列)
- hdu1087 - Super Jumping! Jumping! Jumping! (dp 求递增子序列的最大和)
- HDU 1087 Super Jumping! Jumping! Jumping!(求绝对递增子序列的最大和)
- hdu 1087(最大递增子序列)
- hdu1087 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! (最大递增子序列和)
- hdu1087——Super Jumping! Jumping! Jumping!(最大递增子序列和)
- HDU1087 Super Jumping! Jumping! Jumping! DP求非连续单调递增序列的最大和
- HDU 1087 Super Jumping! Jumping! Jumping! --- DP入门之最大上升子序列
- hdu 1087(最大递增子序列)
- Super Jumping! Jumping! Jumping! HDU - 1087(dp,上升子串求最大和)
- hdu 1087 Super Jumping! Jumping! Jumping!(最长上升子序列&dp)
- (hdu step 3.2.3)Super Jumping! Jumping! Jumping!(DP:求最长上升子序列的最大和)
- HDU1087 Super Jumping! Jumping! Jumping!(动态规划,最大递增子段和)
- HDU 1087 Super Jumping! Jumping! Jumping![动态规划——最大递增子序列]
- HDU 1087 Super Jumping! Jumping! Jumping!(最大递增子串和)