poj2586——Y2K Accounting Bug（贪心）-白红宇

poj2586——Y2K Accounting Bug（贪心）

阅读量：2344 次

发布时间：2019-05-10

本文共 1994 字，大约阅读时间需要 6 分钟。

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

300612

Deficit

英语渣看得很痛苦。。。。

大致是一个MS公司每个月如果盈利就一定赚了s，如果亏损就一定亏了d。这个公司做财报的方式很奇怪，它是每连续五个月做一次，所以一年做了8次（1~5,2~6,3~7….），在1999年这个公司的八次财报都是亏损，但ACM公司却认为这个公司一定盈利。给出s和d，求MS公司1999年最大能盈利多少。

既然盈利和亏损都是确定的，那么一次财报只能有五种情况

1、ssssd

2、sssdd

3、ssddd

4、sdddd

5、ddddd

最大盈利的情况一定是其中的某一种，而且总共8次都是这一种。因为只要有一种财报能求出最大盈利，那么为了能有最大盈利肯定都是这种。并且容易看出能获得的最大盈利是逐渐减少，所以要做的就是依次判断各种情况能不能亏损，然后计算全年收入。为了保证每连续五个月都是一样的情况，一定是按照上面的s在前，d在后

#include 
   
    #include 
    
     #include 
     
      #include 
      
       #include 
       
        //#include 
        
         #include 
         
          #include 
          
           #include 
           
            #include 
            #include 
             
              #define MAXN 1010#define mod 2012#define INF 0x3f3f3f3fusing namespace std;int main(){ ios::sync_with_stdio(false); int s,d; while(cin>>s>>d) { int sum=0; if(s*4
              
               0) cout<
               
                <

转载地址：http://wicvb.baihongyu.com/

你可能感兴趣的文章