hdu1158(很好的一道dp思维练习)

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2015
File Name   :
思路：显然是用dp来做，每个月的人数是只能比num[i]大的，但是为了最小花费，人数必然不会超过max_num;
那么第i个月雇佣j个人的费用应该是来自（i－ 1）月的；如果第（i－ 1）月的人数比第i月实际雇佣的人数大，必然就是裁员；
否则就是增员；所以此时的状态就出来了dp[i][j]表示前i个月（包含第i月）雇佣j个人的总费用；
第一种情况：MIN = min(MIN,dp[i - 1][k] + (k - j)*fire + j * salary);
第二种情况：MIN = min(MIN,dp[i - 1][k] + (j - k)*hire + j * salary);
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
#define pk push_back
template<class T> inline T Get_Max(const T&a,const T&b){return a < b?b:a;}
template<class T> inline T Get_Min(const T&a,const T&b){return a < b?a:b;}
typedef long long ll;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 14;
int dp[N][111];
int num[N];
int hire,salary,fire;
int main()
{	
	// ios::sync_with_stdio(false);
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	int n;
	while(cin >> n && n){
		cin >> hire >> salary >> fire;
		int max_num = 0;
		for (int i = 1;i <= n;i++){
			cin >> num[i];
			max_num = Get_Max(max_num,num[i]);
		}
		for (int i = num[1];i <= max_num;i++)
			dp[1][i] = (hire + salary) * i;
		for (int i = 2;i <= n;i++){
			for (int j = num[i];j <= max_num;j++){
				int MIN = INF;
				for (int k = num[i - 1];k <= max_num;k++){
					if (k < j)
						MIN = Get_Min(MIN,dp[i - 1][k] + (j - k)*hire + j * salary);
					else
						MIN = Get_Min(MIN,dp[i - 1][k] + (k - j)*fire + j * salary);
				}
				dp[i][j] = MIN;
			}
			// dp[i][j] = MIN;
		}
		int ans = INF;
		for (int i = num[n];i <= max_num;i++)
			ans = Get_Min(ans,dp[n][i]);
		cout << ans << endl;
	}
	return 0;
}