HDU 3401 Trade 题解

HDU 3401 Trade 题解

HDU 3401

题目

Recently, lxhgww is addicted to stock, he finds some regular patterns after a few days’ study.
He forecasts the next T days’ stock market. On the i’th day, you can buy one stock with the price APi or sell one stock to get BPi.
There are some other limits, one can buy at most ASi stocks on the i’th day and at most sell BSi stocks.
Two trading days should have a interval of more than W days. That is to say, suppose you traded (any buy or sell stocks is regarded as a trade)on the i’th day, the next trading day must be on the (i+W+1)th day or later.
What’s more, one can own no more than MaxP stocks at any time.

Before the first day, lxhgww already has infinitely money but no stocks, of course he wants to earn as much money as possible from the stock market. So the question comes, how much at most can he earn?

---

输入

The first line is an integer t, the case number.
The first line of each case are three integers T , MaxP , W .
(0 <= W < T <= 2000, 1 <= MaxP <= 2000) .
The next T lines each has four integers APi，BPi，ASi，BSi( 1<=BPi<=APi<=1000,1<=ASi,BSi<=MaxP), which are mentioned above.

---

输出

The most money lxhgww can earn.

---

样例

input
1
5 2 0
2 1 1 1
2 1 1 1
3 2 1 1
4 3 1 1
5 4 1 1

output
3

---

题意

有T组测试数据
不能拥有超过$maxp$张股票
每一次贸易的间隔要超过$w$天（也就是下一次是$w$+1天后）
每天可以买入价为$API$的不超过$ASI$张股票
每天可以卖出价为$BPI$的不超过$BSI$张股票
求最多能赚多少数

---

解题思路

每一次的初值就是当天不买不卖
如果在交易限制的w+1天前就跳过本次循环
然后分别进行买入和卖出的操作
买入的方程：$dp$[$i$][$j$]=$max$($dp$[$i$][$j$], d p dp