POJ Yogurt factory 2393（牛奶厂场）贪心算法

问题描述

题目链接

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.

算法思想及分析：

采用贪心算法, 贪心算法是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，它所做出的是在某种意义上的局部最优解。对于第一周的酸奶，其只能第一周进行生产，对于第二周至第N周的酸奶，就需要考虑是前一周进行生产然后存放到这一周的成本小，还是这一周再进行生产的成本小，需要比较两者的成本大小，如果这一周生产的成本较小，那么就这一周进行生产，否则就上一周进行生产并存放到这一周再售出。a[i-1]表示上一周的生产成本，c表示这一周的生产成本，sum表示成本总和，s表示存储费用,y表示需求数量，写成如下递推公式：if ((a[i-1] + s) > c) sum = sum + c * y; if ((a[i-1] + s) <= c) sum = sum + a[i-1]* y + s*y;

代码：

#include<iostream>
using namespace std;
int main()
{
	int n, s, sum = 0, c = 0, y = 0;
	cin >> n >> s;
	int *a = new int[n];
	for (int i = 1; i <= n; i++)
	{
		cin >> c >> y;
		a[i] = c;
		if (i == 1)
		{
			sum = c * y;
			continue;
		}
		if ((a[i-1] + s) > c)
		{
			sum = sum + c * y;
		}
		if ((a[i-1] + s) <= c)
		{
			sum = sum + a[i-1]* y + s*y;
		}
	}
	cout << sum;
	return 0;
}