POJ 2586:Y2K Accounting Bug

原创 2015年07月09日 19:44:05

Y2K Accounting Bug
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 11297   Accepted: 5686

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

题意是这个公司只有5个月的财务报表,因为一年有12个月,所以这样的财务报表有8个,这8个财务报表都是亏损,这个公司自己也不记得哪个月盈余哪个月亏损,只给出盈余多少,亏损多少。求该公司一年的最好盈余情况,如果不可能盈余,就输出Deficit。

我自己是不知道为什么这道题被归到了贪心里面,就是四种情况取最大值呗。

SSSSDSSSSDSS

SSSDDSSSDDSS

SSDDDSSDDDSS

SDDDDSDDDDSD

之前反倒吃了贪心的亏,忘记了要输出最好情况结果还来了两个WA。

代码:

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

int main()
{
	int s,d;
	while(cin>>s>>d)
	{
		int result=-1;
		if(4*s<d)
		{
			if(10*s-2*d>result)
				result=10*s-2*d;
		}
		if(3*s<2*d)
		{
			if(8*s-4*d>result)
				result=8*s-4*d;
		}
		if(2*s<3*d)
		{
			if(6*s-6*d>=0)
				result= 6*s-6*d;
		}
		if(s<4*d)
		{
			if(3*s-9*d>result)
				result=3*s-9*d;
		}
		if(result<0)
		{
			cout<<"Deficit"<<endl;
		}
		else
		{
			cout<<result<<endl;
		}
	}
	return 0;
}


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

相关文章推荐

POJ2586-Y2K Accounting Bug

Poj -2586 Y2K Accounting Bug--枚举

Total Submissions: 11467   Accepted: 5768 Description Accounting for Computer Machinists (ACM) ha...

poj2586——Y2K Accounting Bug(贪心)

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

Y2K Accounting Bug POJ2586

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

POJ2586:Y2K Accounting Bug

点击打开题目链接 Y2K Accounting Bug Time Limit: 1000MS   Memory Limit: 65536K Total Submissions:...

poj2586Y2K Accounting Bug

背景:再做这道题的时候,我严重怀疑我的英语能力,o(︶︿︶)o 唉,翻译了一个多小时。 思路:由于本题情况比较少,所以可以直接枚举出所有的情况,首先要找出五个月中最少亏损月份,然后就开始枚举出五种情...

poj2586 Y2K Accounting Bug 贪心

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

POJ2586 Y2K Accounting Bug

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

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...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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