HDOJ1158 DP简单题

Employment Planning

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5569    Accepted Submission(s): 2423

Problem Description

A project manager wants to determine the number of the workers needed in every month. He does know the minimal number of the workers needed in each month. When he hires or fires a worker, there will be some extra cost. Once a worker is hired, he will get the salary even if he is not working. The manager knows the costs of hiring a worker, firing a worker, and the salary of a worker. Then the manager will confront such a problem: how many workers he will hire or fire each month in order to keep the lowest total cost of the project. 

 

Input

The input may contain several data sets. Each data set contains three lines. First line contains the months of the project planed to use which is no more than 12. The second line contains the cost of hiring a worker, the amount of the salary, the cost of firing a worker. The third line contains several numbers, which represent the minimal number of the workers needed each month. The input is terminated by line containing a single '0'.

 

Output

The output contains one line. The minimal total cost of the project.

 

Sample Input

  
  

   
   3 
4 5 6
10 9 11
0
  
  

 

Sample Output

  
  

   
   199
  
  

 

Source

Asia 1997, Shanghai (Mainland China)

 

Recommend

Ignatius   |   We have carefully selected several similar problems for you:   1227  1074  1080  1025  1160

状态比较容易看出来吧，第i个月的状态从第i-1个月推出来。如果i-1个月的人数比要的人多了，就要fire，否则hire。

代码如下：

#include <ctime>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;

const int maxn = 15;
const int maxp = 150;
const int inf = 1<<30;
int n;
int num[maxn],hire,fire,salary,max_num;
int dp[maxn][maxp];

int main(){
    std::ios::sync_with_stdio(false);
    while (cin >> n && n){
            max_num=-1;
            cin >> hire >> salary >> fire;
            for (int i=1;i<=n;i++) {
                    cin >> num[i];
                    max_num = max(max_num,num[i]);
            }
            memset(dp,0,sizeof(dp));
            for (int i=1; i<=max_num; i++) dp[1][i]=hire+salary+dp[1][i-1]; //一定要到max_num，这里我就翻车了
            for (int i=2; i<=n; i++) {
                for (int j=num[i];j<=max_num;j++){
                    int ans=inf;
                    for (int k=num[i-1];k<=max_num;k++)
                       if (k<j) ans=min(ans,dp[i-1][k] + (j-k)*hire + j*salary);
                        else ans=min(ans, dp[i-1][k] + (k-j)*fire + j*salary);

                    dp[i][j]=ans;
                }
            }

            int tot = inf;
            for (int i=num[n];i<=max_num;i++) tot=min(tot,dp[n][i]);
            cout<<tot<<endl;
    }
    return 0;
}