1740: [Usaco2005 mar]Yogurt factory 奶酪工厂

维护一个当前最小费用和，比较直接用当前周生产的费用和前面某一周生产的费用的大小

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <iostream>
 4 #include <algorithm>
 5 #include <vector>
 6 #include <queue>
 7 #include <set>
 8 #include <map>
 9 #include <string>
10 #include <math.h>
11 #include <stdlib.h>
12 #include <time.h>
13 using namespace std;
14 
15 int main() {
16     int n, s, minc = 0x7ffffff;
17     long long ans = 0;
18     scanf("%d%d", &n, &s);
19     for (int i = 0; i < n; ++i) {
20         int c, y;
21         scanf("%d%d", &c, &y);
22         if (c > minc + s) c = minc + s;
23         minc = c;
24         ans += minc * y;
25     }
26     printf("%lld\n", ans);
27     return 0;
28 }
View Code

 

posted @ 2016-04-20 21:48  拒绝者\n  阅读(280)  评论(0)    收藏  举报