BZOJ1676: [Usaco2005 Feb]Feed Accounting 饲料计算
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了BZOJ1676: [Usaco2005 Feb]Feed Accounting 饲料计算相关的知识,希望对你有一定的参考价值。
Description
Farmer John is trying to figure out when his last shipment of feed arrived. Starting with an empty grain bin, he ordered and received F1 (1 <= F1 <= 1,000,000) kilograms of feed. Regrettably, he is not certain exactly when the feed arrived. Of the F1 kilograms, F2 (1 <= F2 <= F1) kilograms of feed remain on day D (1 <= D <= 2,000). He must determine the most recent day that his shipment could have arrived. Each of his C (1 <= C <= 100) cows eats exactly 1 kilogram of feed each day. For various reasons, cows arrive on a certain day and depart on another, so two days might have very different feed consumption. The input data tells which days each cow was present. Every cow ate feed from Farmer John‘s bin on the day she arrived and also on the day she left. Given that today is day D, determine the minimum number of days that must have passed since his last shipment. The cows have already eaten today, and the shipment arrived before the cows had eaten.
Input
* Line 1: Four space-separated integers: C, F1, F2, and D * Lines 2..C+1: Line i+1 contains two space-separated integers describing the presence of a cow. The first integer tells the first day the cow was on the farm; the second tells the final day of the cow‘s presence. Each day is in the range 1..2,000.
Output
The last day that the shipment might have arrived, an integer that will always be positive.
Sample Input
1 9
5 8
8 12
INPUT DETAILS:
The shipment was 14 kilograms of feed, and Farmer John has 4 kilograms
left. He had three cows that ate feed for some amount of time in
the last 10 days.
Sample Output
6
上一次运来了14千克饲料,现在饲料还剩下4千克.最近10天里.有3头牛来吃过饲料.
约翰在第6天收到14千克饲料,当天吃掉2千克,第7天吃掉2千克,第8天吃掉3千克,第9天吃掉2千克,第10天吃掉1千克,正好还剩4千克
题解:
不明觉厉的暴力……
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; const int MAXN = 2001; int a[MAXN]; bool use[MAXN]; int num[MAXN]; int C, F1, F2, D; inline void add(int x, int y) { int i; for (i = x; i <= y; i++) num[i]++; } int main(int argc, char *argv[]) { int i, j, x, y; scanf("%d%d%d%d", &C, &F1, &F2, &D); for (i = 1; i <= C; i++) { scanf("%d%d", &x, &y); add(x, y); } int now = F2, day = D ; while (now < F1) { now += num[D]; D--; } printf("%d\n", D+1); return 0; }
以上是关于BZOJ1676: [Usaco2005 Feb]Feed Accounting 饲料计算的主要内容,如果未能解决你的问题,请参考以下文章
差分bzoj 1676 [Usaco2005 Feb]Feed Accounting 饲料计算
bzoj 1734: [Usaco2005 feb]Aggressive cows 愤怒的牛
BZOJ1734: [Usaco2005 feb]Aggressive cows 愤怒的牛
bzoj1733[Usaco2005 feb]Secret Milking Machine 神秘的挤奶机 二分+网络流最大流