poj2586 典型贪心

最新推荐文章于 2018-09-19 22:36:44 发布

PAUL_shuo

最新推荐文章于 2018-09-19 22:36:44 发布

阅读量743

点赞数

分类专栏： ACM算法

本文链接：https://blog.csdn.net/LanQiuChaoRen/article/details/8717352

版权

该博客介绍了如何使用贪心策略解决POJ2586问题。公司12个月中盈亏未知，但知道连续5个月总和总是亏损。通过贪心选择，证明了在满足条件的情况下，最大化盈利的方法。文章讨论了5种情况，并给出了关于盈亏比例的判定条件，以确保可能的最大盈利。

摘要由CSDN通过智能技术生成

Y2K Accounting Bug

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7846		Accepted: 3885

Description

Accounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS Inc.
All what they remember is that MS Inc. posted a surplus or a deficit each month of 1999 and each month when MS Inc. posted surplus, the amount of surplus was s and each month when MS Inc. posted deficit, the deficit was d. They do not remember which or how many months posted surplus or deficit. MS Inc., unlike other companies, posts their earnings for each consecutive 5 months during a year. ACM knows that each of these 8 postings reported a deficit but they do not know how much. The chief accountant is almost sure that MS Inc. was about to post surplus for the entire year of 1999. Almost but not quite.

Write a program, which decides whether MS Inc. suffered a deficit during 1999, or if a surplus for 1999 was possible, what is the maximum amount of surplus that they can post.

Input

Input is a sequence of lines, each containing two positive integers s and d.

Output

For each line of input, outp