HDU1158 Employment Planning
来源:互联网 发布:淘宝店铺简历和介绍 编辑:程序博客网 时间:2024/04/29 19:08
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 610 9 110
Sample Output
199
#include <iostream>using namespace std;int cnt[15];int dp[15][10005];int main() { freopen("C:\\in.txt","r",stdin);int n;while(scanf("%d",&n)!=EOF&&n){int hire,sal,fire;scanf("%d %d %d",&hire,&sal,&fire);int maxC=0;for(int i=1;i<=n;i++){scanf("%d",&cnt[i]);maxC=max(maxC,cnt[i]);}for(int i=1;i<=maxC;i++)dp[1][i]=i*hire+i*sal;for(int i=2;i<=n;i++){for(int j=cnt[i];j<=maxC;j++){int minV=99999999;for(int k=cnt[i-1];k<=maxC;k++){if(k<j)minV=min(minV,dp[i-1][k]+(j-k)*hire+j*sal);else minV=min(minV,dp[i-1][k]+(k-j)*fire+j*sal);}dp[i][j]=minV;}}int minV=99999999;for(int i=cnt[n];i<=maxC;i++)minV=min(minV,dp[n][i]);printf("%d\n",minV);}return 0; }
0 0
- hdu1158 Employment Planning
- HDU1158 Employment Planning
- HDU1158 Employment Planning
- HDU1158:Employment Planning(DP)
- hdu1158 Employment Planning
- HDU1158 Employment Planning
- hdu1158 Employment Planning 【dp】
- hdu1158 Employment Planning
- hdu1158 Employment Planning
- HDU1158 Employment Planning(DP)
- hdu1158——Employment Planning
- HDU1158-Employment Planning(dp)
- hdu1158 Employment Planning【贪心&dp】
- hdu1158 Employment Planning(动态规划)
- hdu1158 Employment Planning(普通DP)
- HDU_1158 Employment Planning
- hdu Employment Planning (dp)
- C基础/Employment Planning
- hdu 4003 树形dp+分组背包
- 让程序的按钮显示UAC的小盾图标
- HDU1087 Super Jumping! Jumping! Jumping!
- HDU1114 Piggy-Bank
- windows 安装开启 telnet 服务
- HDU1158 Employment Planning
- HDU1159 Common Subsequence
- 一切成功源于积累——20140206 如何应对重大利空消息
- js class
- Linux C编程中的环境变量
- HDU1160 FatMouse's Speed
- java中的内存分配
- Struts旅程(三)Struts表单处理器ActionForm(静态动态)
- 获得windows系统相关图标