http://acm.hdu.edu.cn/showproblem.php?pid=1158
用记忆化搜索做的,dp[index][sum]表示第index个月有sum个工人的情况下,以后几个月所用的最小花费,比较简单,直接看代码吧。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <stack>
using namespace std;
#define M 100005
#define ll long long
#define int64 __int64
int n , hire , fire , salary , num[15] , dp[15][105];
int Dfs(int index , int sum)
{
if (index == n)return 0;
if (dp[index][sum] != -1)return dp[index][sum];
int ret;
if (sum <= num[index])//当前人数小于必需的人数,则直接雇佣人就行了
ret = Dfs(index+1,num[index])+(num[index]-sum)*hire+num[index]*salary;
else//开除多余的人
{
int i;
ret = 1<<30;
for (i = num[index] ; i <= sum ; i++)
ret = min(ret,Dfs(index+1,i)+(sum-i)*fire+i*salary);
}
return dp[index][sum] = ret;
}
int main()
{
while (scanf("%d",&n) , n)
{
int i;
scanf("%d%d%d",&hire,&salary,&fire);
for (i= 0 ; i < n ; i++)scanf("%d",num+i);
memset(dp , -1 , sizeof dp);
printf("%d\n",Dfs(0,0));
}
return 0;
}