题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1158
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=12+5;
const int maxp=100+5;
const int INF=0x3f3f3f3f;
int NumWorker[maxn],d[maxn][maxp];
//d[i][j] 表示前i个月，j个人最小开销
int main()
{int month,hire,salary,fire;while(cin>>month,month){cin>>hire>>salary>>fire;int MaxP=0;for(int i=1;i<=month;i++){scanf("%d",&NumWorker[i]);MaxP=max(MaxP,NumWorker[i]);}memset(d,INF,sizeof(d));d[0][0]=0; for(int i=1;i<=month;i++){for(int j=NumWorker[i];j<=MaxP;j++){for(int k=NumWorker[i-1];k<=MaxP;k++)if(j>k) d[i][j]=min(d[i][j],d[i-1][k]+hire*(j-k)+j*salary);else d[i][j]=min(d[i][j],d[i-1][k]+fire*(k-j)+j*salary);}}int ans=INF;for(int i=NumWorker[month];i<=MaxP;i++) ans=min(ans,d[month][i]);cout<<ans<<endl;}return 0;
}