首页 > 代码库 > poj 2586 Y2K Accounting Bug (贪心)
poj 2586 Y2K Accounting Bug (贪心)
Y2K Accounting Bug
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 |
看了小优的才懂题意:
http://blog.csdn.net/lyy289065406/article/details/6642603
大意是一个公司在12个月中,每个月有或固定盈余s,或固定亏损d.
但记不得哪些月盈余,哪些月亏损,只能记得连续5个月的代数和总是亏损(<0为亏损),而一年中只有8个连续的5个月,分别为1~5,2~6,…,8~12
问全年是否可能盈利?若可能,输出可能最大盈利金额,否则输出“Deficit".
这里没用到贪心解法。
1 //156K 16MS C++ 442B 2014-05-11 19:58:29 2 #include<stdio.h> 3 int main(void) 4 { 5 int s,d; 6 while(scanf("%d%d",&s,&d)!=EOF) 7 { 8 int ans=0; 9 if(4*s<d){ 10 ans=10*s-2*d; 11 }else if(3*s<2*d){ 12 ans=8*s-4*d; 13 }else if(2*s<3*d){ 14 ans=6*s-6*d; 15 }else if(s<4*d){ 16 ans=3*s-9*d; 17 }else ans=-1; 18 if(ans<0) puts("Deficit"); 19 else printf("%d\n",ans); 20 } 21 return 0; 22 }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。