POJ 3273 Monthly Expense

最新推荐文章于 2023-09-01 22:00:12 发布

aiLMengi000

最新推荐文章于 2023-09-01 22:00:12 发布

阅读量190

点赞数

分类专栏：二分算法

本文链接：https://blog.csdn.net/aiLMengi000/article/details/83589951

版权

二分算法专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Monthly Expense

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 35430		Accepted: 13213

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

Line 1: Two space-separated integers: N and M
Lines 2..N+1: Line i+1 contains the number of dollars Farmer John spends on the ith day

Output

Line 1: The smallest possible monthly limit Farmer John can afford to live with.

Sample Input

Sample Output

Hint

If 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.

Source

USACO 2007 March Silver

思考：典型的二分题。

求二分：先找上限和下限然后通过mid去找到符合题目的。

就比如这题，求的是在不超过m个月之内的，月花费的最小值。找到上限花费的总钱数和下限单个天的花费最大值。然后再其中找到符合条件（划分的月份不能超过N个）的最小值。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[100100];
int n,m;
bool check(int d){
	int t=1;
	int sum=0;
	for(int i=0;i<n;i++){
		if(sum+a[i]<=d){
			sum+=a[i];
		}else{
			t++;
			sum=a[i];
		}
	}
	
	if(t>m) return false;
	else return true;
}
int main(){
	
	int sum=0;
	int max=0;
	scanf("%d %d",&n,&m);
	for(int i=0;i<n;i++){
		scanf("%d",&a[i]);
		if(max<=a[i]){
			max=a[i];
		}
		sum+=a[i];
	}
	int save=0;
	int h=sum;
	int l=max;
	while(l<=h){
		int mid=l+(h-l)/2;
		if(check(mid)){
			save=mid;
			h=mid-1;
		}else{
			l=mid+1;
		}
	}
	printf("%d",save);
	return 0;
}

注意：二分就是按照这个步骤来的。