POJ2586 Y2K Accounting Bug (簡單貪心問題)

原创 2015年04月17日 01:56:50

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, output one line containing either a single integer giving the amount of surplus for the entire year, or output Deficit if it is impossible.

Sample Input

59 237
375 743
200000 849694
2500000 8000000

Sample Output

116
28
300612
Deficit

Source

Waterloo local 2000.01.29


若明白題意,這道題是比較簡單的。
題目大意:有一個公司,該公司每個月的盈利或虧損是固定的,分別爲s和d。每5個月公布一次經營狀況,一年共公布8次(1-5,2-6...8-12)。而且這8次都是虧損的。現在題目給出s和d,求這一年最大的盈利可以是多少。如果沒有可能盈利,這輸出Deficit。

分析:首先我們可以確定,要使盈利盡可能大,則虧損的月份應該盡量少。所以應用貪心策勵可以得出下表(轉自discuss的表)
在保证连续5个月都亏损的前提下,使得每5个月中亏损的月数最少。根据d和s的不同五种情况
              x=1:  ssssd,ssssd,ss    d>4s     赢利10个月    10s-2d
              x=2:  sssdd,sssdd,ss    2d>3s    赢利8个月     8s-4d
              x=3:  ssddd,ssddd,ss    3d>2s    赢利6个月     6s-6d
              x=4:  sdddd,sdddd,sd    4d>s     赢利3个月     3s-9d  //要特別注意這一種情況
              x=5:  ddddd,ddddd,dd         无赢利
注意:0也算是盈利

以上表中的正確性,可以通過貪心來證明。簡單來說就是在每五個月中,若選定了一種五個月中d的月份數,則應當讓這8次都只含有這麼多個d月份數,這樣才可以騰出更多的總s月份數。

#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;

int main()
{
    long long ans, s, d;
    while(~scanf("%lld%lld", &s, &d)){
        if(d > s * 4) ans = 10 * s - 2 * d;
        else if(2 * d > 3 * s) ans = 8 * s - 4 * d;
        else if(3 * d > 2 * s) ans = 6 * s - 6 * d;
        else if(4 * d > s) ans = 3 * s - 9 * d;
        else ans = -1;
        if(ans >= 0) printf("%lld\n", ans);
        else printf("Deficit\n");
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

poj2586——Y2K Accounting Bug(贪心)

DescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vit...

poj2586 Y2K Accounting Bug 贪心

///2014.3.3 ///poj2586 /** *题目大意是一个公司在12个月中,或固定盈余s,或固定亏损d. *但记不得哪些月盈余,哪些月亏损, *只能记得连续5个月的代数和总是亏损(...

POJ 2586 Y2K Accounting Bug(贪心+枚举)

原题地址http://poj.org/problem?id=2586 题意:已知每个月的经营状况要么盈利s,要么亏损d,若每五个月的汇总都是亏损,求这一年12个月最大盈利额(不能盈利则输出Defi...

【贪心】POJ-2586 Y2K Accounting Bug

Y2K Accounting Bug Time Limit: 1000MS   Memory Limit: 65536K       Descri...

poj 2586 Y2K Accounting Bug (贪心)

Y2K Accounting Bug Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8678   Accepte...

POJ 2586 Y2K Accounting Bug (贪心)

Y2K Accounting Bug Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 13878   Accept...
  • cg66570
  • cg66570
  • 2016年09月30日 13:03
  • 100

【贪心】POJ2586 Y2K Accounting Bug

Y2K Accounting Bug Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9553...

poj 2586 Y2K Accounting Bug【贪心】【刷题计划】

Y2K Accounting Bug Time Limit: 1000MS   Memory Limit: 65536K Total Submissio...

POJ 2586 Y2K Accounting Bug (贪心)

题目链接: http://poj.org/problem?id=2586 Y2K Accounting Bug Time Limit: 1000MS   Memory ...
  • sizaif
  • sizaif
  • 2017年05月30日 12:11
  • 188

POJ2586 Y2K Accounting Bug(贪心)

Y2K Accounting Bug Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10975   Accep...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ2586 Y2K Accounting Bug (簡單貪心問題)
举报原因:
原因补充:

(最多只允许输入30个字)