NBUT-2014暑期集训专题练习1 -> 二分法L - L
来源:互联网 发布:完美告白知乎 编辑:程序博客网 时间:2024/05/22 22:40
Description
Farmer 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.
Input
Lines 2.. N+1: Line i+1 contains the number of dollars Farmer John spends on the ith day
Output
二分题
#include<stdio.h>
#include<string.h>
int day[100010];
int n,m;
bool _ok(int mid)
{
int seg=0;
int sum=0;
for(int i=0;i<n;i++)
{
if(day[i]>mid)//单个就超过mid,显然不行
return false;
sum+=day[i];
if(sum>mid)
{
seg++;
sum=day[i];//多加一组
}
}
return seg<m;
}
int main()
{
while(~scanf("%d%d",&n,&m))
{
int max=0,min=0x3f3f3f3f;
for(int i=0;i<n;i++)
{
scanf("%d",&day[i]);
max+=day[i];
if(min>day[i])
min=day[i];
}
int l=min,r=max,mid;
while(l<=r)
{
mid=(l+r)/2;
if(_ok(mid))
r=mid-1;
else
l=mid+1;
}
printf("%d\n",r+1 );
}
return 0;
}
- NBUT-2014暑期集训专题练习1 -> 二分法L - L
- NBUT-2014暑期集训专题练习1 -> 二分法 A题
- NBUT-2014暑期集训专题练习1 -> 二分法E - E
- NBUT-2014暑期集训专题练习1 -> 二分法 J - J
- NBUT-2014暑期集训专题练习1 -> 二分法 H - H
- NBUT-2014暑期集训专题练习1 -> 二分法B - B
- NBUT-2014暑期集训专题练习1 -> 二分法F - F
- NBUT-2014暑期集训专题练习1 -> 二分法 N - N
- l练习
- l练习
- 二分法l例 E
- 2013秋13级预备队集训练习1 L - Linear Cellular Automata
- java:--l;l--;l-1
- 2016暑期集训12C L国货物运输 HDU 5699货物运输
- 【二分图匹配入门专题1】L
- 1012-L专题三
- 专题三 Problem L
- 专题四 Problem L
- NBUT-2014暑期集训专题练习1 -> 二分法 A题
- NBUT-2014暑期集训专题练习1 -> 二分法E - E
- NBUT-2014暑期集训专题练习1 -> 二分法 J - J
- NBUT-2014暑期集训专题练习1 -> 二分法 H - H
- NBUT-2014暑期集训专题练习1 -> 二分法B - B
- NBUT-2014暑期集训专题练习1 -> 二分法L - L
- NBUT-2014暑期集训专题练习1 -> 二分法F - F
- nbut线段树专题E - Just a Hook
- nbut线段树专题F - A Simple Problem with Integers
- nbut线段树专题I - Balanced Lineup
- <vim>VIM各种tips
- nbut线段树专题C - Mayor\'s posters
- nbut线段树专题W - Frequent values
- nbut线段树专题M - Buy Tickets