hdoj1087专题
HDOJ1087 Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping! http://acm.hdu.edu.cn/showproblem.php?pid=1087 分析： 简单的动态规划题。题目的意思很直白，其实就是寻找最长递增子序列。 假设dp[i]表示的是从start到达第i个点时可获得的最大分数，data[i]表示的是第i个点的分数值，那么可以得到， dp[i]= max{dp[i]
hdoj1087超级跳跳跳 最大升序字段和
题目描述 Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.