HDU - 1087 Super Jumping! Jumping! Jumping! (简单LIS)
2014-07-12 19:57
453 查看
HDU - 1087 Super Jumping! Jumping! Jumping!
题意:
n个数中,选出升序的序列,使得和最大
分析:
第i个数为结尾的时候,前面比他小的数都能加上,选择和最大的,最优化原理
状态dp[i]:表示以i结尾时的最大和
转移方程:
代码:
题意:
n个数中,选出升序的序列,使得和最大
分析:
第i个数为结尾的时候,前面比他小的数都能加上,选择和最大的,最优化原理
状态dp[i]:表示以i结尾时的最大和
转移方程:
dp[i] = max(dp[i], dp[j]+1);核心:
for(i = 1; i<=n; i++) { dp[i] = v[i]; for(j = 1; j<i; j++) { if(a[i] > a[j]) dp[i] = max(dp[i], dp[j] + v[i]); } }
代码:
#include <stdio.h> #include <iostream> #include <string.h> #include <string> #include <math.h> #include <algorithm> #include <queue> #include <stack> #include <map> #include <vector> #include <time.h> using namespace std; int v[100+10]; int dp[100+10]; int main() { //freopen("a.txt", "r", stdin); int n, i, j, ans; while(~scanf("%d", &n) && n) { for(i = 1; i<=n; i++) { scanf("%d", &v[i]); } ans = 0; memset(dp, 0, sizeof(dp)); for(i = 1; i<=n; i++) { dp[i] = v[i]; for(j = i-1; j>=1; j--) { if(v[i] > v[j]) dp[i] = max(dp[i], dp[j] + v[i]); } ans = max(ans, dp[i]); } printf("%d\n", ans); } return 0; }
相关文章推荐
- HDU - 1087 Super Jumping! Jumping! Jumping! (简单LIS)
- hdu 1087 Super Jumping! Jumping! Jumping! (简单 LIS)
- hdu 1087Super Jumping! Jumping! Jumping!(简单的dp就是一个判断条件两个for循环,将这个量与前面出现的两进行比较)
- hdu 1087 Super Jumping! Jumping! Jumping!(简单dp)
- HDU1087 Super Jumping! Jumping! Jumping!(LIS)
- HDU 1087 Super Jumping! Jumping! Jumping! ——LIS
- HDU 1087 Super Jumping! Jumping! Jumping! 【简单dp思维题】
- HDU 1087 Super Jumping! Jumping! Jumping! -- 简单动态规划
- [简单DP]Super Jumping! Jumping! Jumping! HDU - 1087
- HDU 1087 Super Jumping! Jumping! Jumping! && 1114 Piggy-Bank 简单dp
- 【hdu 1087】 Super Jumping! Jumping! Jumping! (LIS变形)
- HDU 1087 Super Jumping! Jumping! Jumping! 简单Dp
- hdu 1087 Super Jumping! Jumping! Jumping! (LIS)
- hdu 1087 Super Jumping! Jumping! Jumping!(简单dp)
- HDU 1087 Super Jumping! Jumping! Jumping! (DP+LIS)
- HDU:1087 Super Jumping! Jumping! Jumping!(DP,LIS问题)
- HDU 1087-Super Jumping! Jumping! Jumping!(简单DP)
- [HDU 1087]Super Jumping! Jumping! Jumping!(类LIS DP)
- 【HDU 1087 】Super Jumping! Jumping! Jumping! 【LIS 的变形】
- (step3.2.2)hdu 1087(Super Jumping! Jumping! Jumping!——简单DP)