二分PKU3273
来源:互联网 发布:矩阵切换器怎么使用 编辑:程序博客网 时间:2024/06/05 06:10
<span style="color:#3333ff;">/*F - 二分Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionFarmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤ moneyi ≤ 10,000) that he will need to spend each day over the next N (1 ≤ N ≤ 100,000) days.FJ wants to create a budget for a sequential set of exactly M (1 ≤ M ≤ N) fiscal periods called "fajomonths". Each of these fajomonths contains a set of 1 or more consecutive days. Every day is contained in exactly one fajomonth.FJ's goal is to arrange the fajomonths so as to minimize the expenses of the fajomonth with the highest spending and thus determine his monthly spending limit.InputLine 1: Two space-separated integers: N and MLines 2.. N+1: Line i+1 contains the number of dollars Farmer John spends on the ith dayOutputLine 1: The smallest possible monthly limit Farmer John can afford to live with.Sample Input7 5100400300100500101400Sample Output500HintIf Farmer John schedules the months so that the first two days are a month, the third and fourth are a month, and the last three are their own months, he spends at most $500 in any month. Any other method of scheduling gives a larger minimum monthly limit.#include<iostream>By Grant Yaun2014.7.16*/#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cstdlib>using namespace std;int n,m;int a[100005];int sum;int ans;int low,high,mid;bool can(int k){ sum=0;int sum1=0; for(int i=0;i<n;i++) if(a[i]>k) return false; for(int i=0;i<n;i++) { if(sum+a[i]<=k){ sum+=a[i]; } else { sum=a[i]; sum1++;} } sum1++; if(sum1<=m) return true; return false;}int main(){ int max=0; while(~scanf("%d%d",&n,&m)){ for(int i=00;i<n;i++) {cin>>a[i]; max+=a[i];} low=0;high=max; while(low<=high){ mid=(low+high)*0.5; if(can(mid)){ high=mid-1; ans=mid; } else low=mid+1;} cout<<ans<<endl;} return 0;}</span>
0 0
- 二分PKU3273
- pku3273 Monthly Expense
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分。
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分~~
- 二分
- VC实现动态菜单的创建方法
- 编程算法 - 把字符串转换为整数 代码(C)
- Jquery Post处理后不进入回调的原因及解决方法
- 【Leetcode长征系列】Search Insert Position
- android 百度地图使用tabhost 无法定位,解决办法
- 二分PKU3273
- 变长结构体的使用
- 数据库保存原来数据更新
- 验证用户的某些操作功能是否已登录
- KVM,QEMU核心分析
- 产品运营内容的建设
- MySql-pratices
- AIX测试服务器上扩展文件系统大小的过程
- iphone手机连接USB时出现需要Mobile device setup disk上的usbaapl.sys文件