摘要:
题目在这里 http://acm.hdu.edu.cn/showproblem.php?pid=3401很明显的动态规划,每一天都有三种情况,不买不卖,买或者卖状态转移方程是:对于买f[i][j] = max (f[i][j], f[r][k] - (j - k) * ap[i]) 1 <= r <= i - w -1 , max(0, j - as[i]) <= k < j对于卖f[i][j] = max (f[i][j], f[r][k] + (j - k) * ap[i]) 1 <= r <= i - w -1 , min(maxp, j + bs[i 阅读全文