博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
POJ 2459 Feed Accounting(我的水题之路——英文题啊!!!)
阅读量:4069 次
发布时间:2019-05-25

本文共 2854 字,大约阅读时间需要 9 分钟。

Feed Accounting
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 1368   Accepted: 755

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

3 14 4 101 95 88 12

Sample Output

6

Hint

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. 
OUTPUT DETAILS: 
If Farmer John started with 14 kg of feed on day 6, then on days 6 and 7, two kilograms would be eaten each day. On day 8, three kilograms would be eaten. On day 9, two kilograms would be eaten. On day 10, one kilogram would be eaten. Thus, the total eaten would be 2 + 2 + 3 + 2 + 1 = 10, leaving him with 4 kilograms.

Source

好吧,这道是英文题,太难看了,沉住气,沉住气T_T!!
题意理解:就是说有一个人,有F1公斤的草料,需要储存到一个空仓库中,但是不知道要从什么时候开始添加才能够保证,在第D天的时候还剩下F2公斤草料,因为这个人家附近后C头牛出没,他们会来偷吃草料,每头牛来偷吃草料的时间段不一样。如果牛过来吃草料的时候,草料就会少,且每头牛每天吃且仅吃1公斤/天/头。问,如果要保证第D天的时候会剩余下F2公斤草料,需要在哪一天的时候添加这F1公斤草料。
代码(1AC):
#include 
#include
#include
int account[2100];int main(void){ int c, f1, f2, d; int day1, day2; int i, j, result, tmp; while (scanf("%d%d%d%d", &c, &f1, &f2, &d) != EOF){ memset(account, 0, sizeof(account)); for (i = 0; i < c; i++){ scanf("%d%d", &day1, &day2); for (j = day1; j <= day2; j++){ account[j]++; } } tmp = f1 - f2; for (i = d; i >= 1 && tmp > 0; i--){ tmp -= account[i]; } printf("%d\n", i + 1); } return 0;}

转载地址:http://iooji.baihongyu.com/

你可能感兴趣的文章
SQL语句(六) 自主存取控制
查看>>
《计算机网络》第五章 运输层 ——TCP和UDP 可靠传输原理 TCP流量控制 拥塞控制 连接管理
查看>>
堆排序完整版,含注释
查看>>
二叉树深度优先遍历和广度优先遍历
查看>>
生产者消费者模型,循环队列实现
查看>>
PostgreSQL代码分析,查询优化部分,process_duplicate_ors
查看>>
PostgreSQL代码分析,查询优化部分,canonicalize_qual
查看>>
PostgreSQL代码分析,查询优化部分,pull_ands()和pull_ors()
查看>>
ORACLE权限管理调研笔记
查看>>
移进规约冲突一例
查看>>
IA32时钟周期的一些内容
查看>>
SM2椭圆曲线公钥密码算法
查看>>
获得github工程中的一个文件夹的方法
查看>>
《PostgreSQL技术内幕:查询优化深度探索》养成记
查看>>
PostgreSQL查询优化器详解之逻辑优化篇
查看>>
STM32中assert_param的使用
查看>>
C语言中的 (void*)0 与 (void)0
查看>>
vu 是什么
查看>>
io口的作用
查看>>
IO口的作用
查看>>