[HAOI2010]订货 DP

Description
某公司估计市场在第i个月对某产品的需求量为Ui，已知在第i月该产品的订货单价为di，上个月月底未销完的单位产品要付存贮费用m，假定第一月月初的库存量为零，第n月月底的库存量也为零，问如何安排这n个月订购计划，才能使成本最低？每月月初订购，订购后产品立即到货，进库并供应市场，于当月被售掉则不必付存贮费。假设仓库容量为S。

---

Sample Input
3 1 1000
2 4 8
1 2 4

---

Sample Output
34

---

设f[i][j]为到第i个月库存为j的最优费用，
直接转移即可。

---

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long LL;
int _min(int x, int y) {return x < y ? x : y;}
int _max(int x, int y) {return x > y ? x : y;}
int read() {
	int s = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
	return s * f;
}

int u[51], d[51];
int f[2][21000];

int main() {
	int n = read(), m = read(), S = read();
	for(int i = 1; i <= n; i++) u[i] = read();
	for(int i = 1; i <= n; i++) d[i] = read();
	for(int i = 0; i <= S; i++) f[0][i + 10000] = (LL)(i + u[1]) * d[1];
	int now = 0;
	for(int i = 2; i <= n; i++) {
		now ^= 1; memset(f[now], 63, sizeof(f[now]));
		f[now][-u[i] + 10000] = f[now ^ 1][10000];
		for(int j = -u[i] + 1; j <= S; j++) {
			if(j + u[i] <= S) f[now][j + 10000] = _min(f[now][j + 10000], f[now ^ 1][j + u[i] + 10000] + (LL)m * (j + u[i]));
			f[now][j + 10000] = _min(f[now][j + 10000], f[now][j + 9999] + d[i]);
		}
	} printf("%d\n", f[now][10000]);
	return 0;
}