hdu1158 2010.3.5

hdu1158 2010.3.5

Employment Planning

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 1081    Accepted Submission(s): 381

 

 

Problem Description

A project manager wants to determine thenumber of the workers needed in every month. He does know the minimal number ofthe workers needed in each month. When he hires or fires a worker, there willbe some extra cost. Once a worker is hired, he will get the salary even if heis not working. The manager knows the costs of hiring a worker, firing aworker, and the salary of a worker. Then the manager will confront such aproblem: how many workers he will hire or fire each month in order to keep thelowest 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 theproject planed to use which is no more than 12. The second line contains thecost 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 ofthe workers needed each month. The input is terminated by line containing asingle '0'.

 

 

 

Output

The output contains one line. The minimaltotal 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

#include<stdio.h>
int a[15];
int f[15][1001];
int main()
{
    int month,i,j,k,max,min;
    int hire,salary,fire;
    for(;;)
    {
        scanf("%d",&month);getchar();
        if(month==0) break;
        max=0;
        scanf("%d %d %d",&hire,&salary,&fire);getchar();
        for(i=1;i<=month;i++)
        {
            scanf("%d",&a[i]);getchar();
            if(a[i]>max) max=a[i];
        }
        for(i=a[1];i<=max;i++)
            f[1][i]=(hire+salary)*i;
        for(i=2;i<=month;i++)
            for(j=a[i];j<=max;j++)
            {
                f[i][j]=0x1FFFFFFF;
                for(k=a[i-1];k<=max;k++)
                {
                    if(j<k)
                    {
                        if(f[i-1][k]+fire*(k-j)+j*salary<f[i][j])
                            f[i][j]=f[i-1][k]+fire*(k-j)+j*salary;
                    }
                    else if(j==k)
                    {
                        if(f[i-1][k]+salary*j<f[i][j])
                            f[i][j]=f[i-1][k]+salary*j;
                    }
                    else if(j>k)
                    {
                        if(f[i-1][k]+hire*(j-k)+salary*j<f[i][j])
                            f[i][j]=f[i-1][k]+hire*(j-k)+salary*j;
                    }
                }
            }
        min=f[month][a[month]];
        for(i=a[month]+1;i<=max;i++)
            if(f[month][i]<min)
                min=f[month][i];
        printf("%d\n",min);
    }
    return 0;
}