HDU 1087 Super Jumping! Jumping! Jumping!
2014-07-23 22:57
405 查看
求递增子序列的最大和,没什么好说的。
粗暴1A,嘎嘎!
代码君
粗暴1A,嘎嘎!
//#define LOCAL #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; int a[1010]; int dp[1010]; int main(void) { #ifdef LOCAL freopen("1087in.txt", "r", stdin); #endif int n; while(scanf("%d", &n) && n) { int i; for(i = 0; i < n; ++i) { scanf("%d", &a[i]); dp[i] = a[i]; } for(i = 1; i < n; ++i) for(int j = 0; j < i; ++j) { if(a[j] < a[i]) dp[i] = max(dp[i], dp[j] + a[i]); } int ans = a[0]; for(i = 1; i < n; ++i) ans = max(ans, dp[i]); printf("%d\n", ans); } return 0; }
代码君
相关文章推荐
- hdu 1087 Super Jumping! Jumping! Jumping!(基础DP,最大上升子序列和)
- hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!(动态规划DP)
- E - 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!
- 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!(最大递增子段和)
- 动态规划训练17 [Super Jumping! Jumping! Jumping! HDU - 1087 ]
- 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!
- HDU_1087_SuperJumping!Jumping!Jumping!