暑假集训——贪心 P - Yogurt factory 奶牛场
2015-07-23 21:02
281 查看
P - Yogurt factory
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will cost the company C_i (1 <= C_i <= 5,000) cents to produce one unit of
yogurt in week i. Yucky's factory, being well-designed, can produce arbitrarily many units of yogurt each week.
Yucky Yogurt owns a warehouse that can store unused yogurt at a constant fee of S (1 <= S <= 100) cents per unit of yogurt per week. Fortuitously, yogurt does not spoil. Yucky Yogurt's warehouse is enormous, so it can hold arbitrarily many units of yogurt.
Yucky wants to find a way to make weekly deliveries of Y_i (0 <= Y_i <= 10,000) units of yogurt to its clientele (Y_i is the delivery quantity in week i). Help Yucky minimize its costs over the entire N-week period. Yogurt produced in week i, as well as any
yogurt already in storage, can be used to meet Yucky's demand for that week.
Input
* Line 1: Two space-separated integers, N and S.
* Lines 2..N+1: Line i+1 contains two space-separated integers: C_i and Y_i.
Output
* Line 1: Line 1 contains a single integer: the minimum total cost to satisfy the yogurt schedule. Note that the total might be too large for a 32-bit integer.
Sample Input
Sample Output
Hint
OUTPUT DETAILS:
In week 1, produce 200 units of yogurt and deliver all of it. In week 2, produce 700 units: deliver 400 units while storing 300 units. In week 3, deliver the 300 units that were stored. In week 4, produce and deliver 500 units.
分析:
任务规定,一个酸奶制造厂,在n个星期内,分别要向外提供a[i]unit的酸奶。已知这个制造厂第i周制造每unit酸奶的费用为b[i],储存室储存每1unit酸奶1星期的费用为m。问要完成这个任务的最小费用是多少。
本题又是一种贪心思想,先假设一个最优解,然后出现更好的,就去调换,不是最好的,就保持不变
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will cost the company C_i (1 <= C_i <= 5,000) cents to produce one unit of
yogurt in week i. Yucky's factory, being well-designed, can produce arbitrarily many units of yogurt each week.
Yucky Yogurt owns a warehouse that can store unused yogurt at a constant fee of S (1 <= S <= 100) cents per unit of yogurt per week. Fortuitously, yogurt does not spoil. Yucky Yogurt's warehouse is enormous, so it can hold arbitrarily many units of yogurt.
Yucky wants to find a way to make weekly deliveries of Y_i (0 <= Y_i <= 10,000) units of yogurt to its clientele (Y_i is the delivery quantity in week i). Help Yucky minimize its costs over the entire N-week period. Yogurt produced in week i, as well as any
yogurt already in storage, can be used to meet Yucky's demand for that week.
Input
* Line 1: Two space-separated integers, N and S.
* Lines 2..N+1: Line i+1 contains two space-separated integers: C_i and Y_i.
Output
* Line 1: Line 1 contains a single integer: the minimum total cost to satisfy the yogurt schedule. Note that the total might be too large for a 32-bit integer.
Sample Input
4 5 88 200 89 400 97 300 91 500
Sample Output
126900
Hint
OUTPUT DETAILS:
In week 1, produce 200 units of yogurt and deliver all of it. In week 2, produce 700 units: deliver 400 units while storing 300 units. In week 3, deliver the 300 units that were stored. In week 4, produce and deliver 500 units.
分析:
任务规定,一个酸奶制造厂,在n个星期内,分别要向外提供a[i]unit的酸奶。已知这个制造厂第i周制造每unit酸奶的费用为b[i],储存室储存每1unit酸奶1星期的费用为m。问要完成这个任务的最小费用是多少。
本题又是一种贪心思想,先假设一个最优解,然后出现更好的,就去调换,不是最好的,就保持不变
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
#include<stdio.h> int main() { int i,n,m,a,b,c=5010; long long s=0; scanf("%d %d",&n,&m); for(i=0;i<n;i++) { scanf("%d %d",&a,&b); if(a>c+m) a=c+m; //保持最优单价 c=a; s+=a*b; } printf("%lld\n",s); return 0; }
相关文章推荐
- Android sqlite数据库的用法
- linux C 异常处理的方式
- 按键事件在native和jni中的流程
- 小顶堆的插入删除操作
- 11 个 Visual Studio 代码性能分析工具
- 栈区和堆区
- 四种常见的 POST 提交数据方式
- hdu5301(2015多校2)--Buildings(构造)
- OC-省市区字典数组
- OC -- 解析练习(movielist/activitylist/Xi malaya)
- win7中如何完全卸载已装的JDK
- 【分享】UIViewController生命周期简单归纳
- Arduino Wire.h 库函数基本操作 IIC
- 【CODEFORCES】 E. Pillars
- Linux学习笔记
- Linux C语言错误处理(转载)http://www.cnblogs.com/nliao/archive/2010/09/09/1822647.html
- dbn_svr代码遇到的问题及解决办法
- Best Time to Buy and Sell Stock II
- HDU5296 Annoying problem(LCA)
- POJ2352树状数组入门统计前面有多少个数与求逆序数对类似