P2517 [HAOI2010] 订货

最新推荐文章于 2024-09-12 13:19:42 发布

23010359

最新推荐文章于 2024-09-12 13:19:42 发布

阅读量190

点赞数 1

文章标签：算法

本文链接：https://blog.csdn.net/yfuffdigtybcg/article/details/137503232

版权

#include <bits/stdc++.h>
#define INF (0x3f3f3f3f)
#define ll long long
#define Ms(_data) memset(_data,0,sizeof(_data))
#define Msn(_data,_num) memset(_data,_num,sizeof(_data))
using namespace std;
#define Mymax(a,b) if(a<b) a = b;
#define Mymin(a,b) if(a>b) a = b;
#define il inline
#define rg register
#define For(i,j) for( rg int (i) = 1 ; (i) <= (j) ; (i)++ )
#define For0(i,j) for( rg int (i) = 0 ; (i) < (j) ; (i)++ )
#define Forx(i,j,k) for( rg int (i) = (j) ; (i) <= (k) ; (i)++ )
#define Forstep(i,j,k,st) for( rg int (i) = (j) ; (i) <= (k) ; (i) += (st) )
/
/
#define MAXN 60
#define MAXS 10010
int n,m,s;
int u[MAXN], d[MAXN];

int dp[MAXN][MAXS];
int mintmp[MAXN][MAXS];
// dp[i][j] 表示第i个月,卖之后库存为j的最小花费

il int F( int i , int k ){
	return dp[i-1][k] + k*m - k*d[i];
}
il void M( int i , int k ){
	if( k == 0 ) mintmp[i][k] = F(i,k);
	else mintmp[i][k] = min(mintmp[i][k-1],F(i,k));
}
il void Pre( int i ){
	Forx(j,0,s)
		M(i,j);
}

int main(){
	Msn(dp,INF);
	Msn(mintmp,INF);

	scanf("%d%d%d",&n,&m,&s);
	For(i,n) scanf("%d",&u[i]);
	For(i,n) scanf("%d",&d[i]);

	dp[0][0] = 0;
	For(i,n){
		Pre(i);
		For0(j,s+1){
			int klimit = min(j+u[i],s);
			dp[i][j] = mintmp[i][klimit] + (j+u[i])*d[i];
		}
	}

	int ans = dp[n][0];
	printf("%d\n",ans);

	return 0;
}