DP
Tsingcheng_liu
真*蒟蒻
展开
-
HDU-2048 数塔 DP入门
HDU 2048原创 2017-08-12 16:21:25 · 323 阅读 · 0 评论 -
Super Jumping! Jumping! Jumping! HDU - 1087
题目地址 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.原创 2017-08-12 16:41:52 · 230 阅读 · 0 评论 -
Max Sum HDU - 1003 求最大和
HDU 1003 题目描述 Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +原创 2017-08-12 17:00:27 · 389 阅读 · 0 评论 -
POJ 2355 Railway tickets 线性DP
题目地址~ 题目大意: X为距离 , 当0C1。 L1C2。L2 思路: 线性dp, 直接在for循环里判断就好了, dp[i] = min(dp[j]+cost, 0 AC CODE: #include #include #include using namespace std; int dp[10010]; int main(void) { in原创 2017-08-12 17:10:38 · 328 阅读 · 0 评论