Y2K Accounting Bug(二进制+枚举)
2015-10-01 13:08
387 查看
E - Y2K Accounting BugTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d& %I64uSubmit Status Practice POJ2586Appoint description: System Crawler (2015-09-28)DescriptionAccounting 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 howmany 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 almostsure 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.InputInput is a sequence of lines, each containing two positive integers s and d.OutputFor 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 8000000Sample Output
116 28 300612 Deficit
题意:
题意真心看不懂,之后看了题解才知道怎么做。他就是说每个月分别只有盈利与亏损两种情况,而还有个附加条件就是1-5,
2-6,3-7,4-8,5,9,6-10,7-11,8-12,都要是亏损的。求在这种情况下的1-12个月总和是大于零的最大值。
AC代码:
#include<iostream>#include<algorithm>#include<cstring>#include<string>#include<cstdio>#include<vector>#include<cmath>using namespace std;#define T 5005#define inf -0x3f3f3f3fint a[12],b[2],c;bool jugde(){for(int i=0;i<=7;++i){if(b[a[i]]+b[a[i+1]]+b[a[i+2]]+b[a[i+3]]+b[a[i+4]]>=0)return false;}return true;}int Sum(){int s=0;for(int i=0;i<12;++i)s+=b[a[i]];return s;}void out(){for(int i=11;i>=0;--i)printf("%d ",a[i]);printf("\n");}int main(){/*freopen("input.txt","r",stdin);*/int n,m,i,j,k,tmp,sum;while(~scanf("%d%d",&b[0],&b[1])){sum = 0;b[1]=-b[1];for(i=0;i<(1<<12);++i){c=0;j=i;while(c<12){a[c++]=j&1;j>>=1;}/*out();*/if(jugde()){sum=max(sum,Sum());}}if(sum!=0)printf("%d\n",sum);elseprintf("Deficit\n");}return 0;}
相关文章推荐
- 使用C++实现JNI接口需要注意的事项
- 关于指针的一些事情
- c++ primer 第五版 笔记前言
- share_ptr的几个注意点
- Lua中调用C++函数示例
- Lua教程(一):在C++中嵌入Lua脚本
- Lua教程(七):数据结构详解
- Lua教程(二):C++和Lua相互传递数据示例
- 解析从源码分析常见的基于Array的数据结构动态扩容机制的详解
- C#数据结构揭秘一
- C++联合体转换成C#结构的实现方法
- C++编写简单的打靶游戏
- C++ 自定义控件的移植问题
- C++变位词问题分析
- C/C++数据对齐详细解析
- C++基于栈实现铁轨问题
- C++中引用的使用总结
- 使用Lua来扩展C++程序的方法
- C++中调用Lua函数实例
- Lua和C++的通信流程代码实例