通用版2.T-优快云博客

本文介绍了一个关于Yucky Yogurt工厂的生产调度问题，目标是在未来N周内根据变化的成本和客户需求，通过最优的生产和存储策略来最小化总成本。文中提供了一段C++代码实现，通过动态规划的方法解决了这一问题。

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.

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
long long c[10000],y[10000],ans;
int main()
{
    int i,n,s;
    while(~scanf("%d%d",&n,&s)){
        ans=0;
        for(i=0;i<=n-1;i++){
            scanf("%d%d",&c[i],&y[i]);
            if(i!=0){
                c[i]=min(c[i-1]+s,c[i]);
            }
            ans+=c[i]*y[i];
        }
        printf("%lld\n",ans);
    }
    return 0;
}

残念的英语

题意是牛奶每周生产价格会有变化，公司有足够大的仓库储存牛奶，给出每单位牛奶每周储存需要的费用s，将来n周每周每单位牛奶的价格以及客户需求量，求将来n周所需最小生产成本

这道题只要每次取min(c[i-1]+s,c[i])就可以，将上周生产的最小价格加上一周的储存费用，与这周直接生产作比较