Monthly Expense解题报告

原创 2012年03月25日 19:22:26

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 nextN (1 ≤ N ≤ 100,000) days.

FJ wants to create a budget for a sequential set of exactly M (1 ≤ MN) 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 andM
Lines 2..N+1: Line i+1 contains the number of dollars Farmer John spends on theith day

Output

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

Sample Input

7 5
100
400
300
100
500
101
400

Sample Output

500

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.
#include<iostream>
using namespace std;
const int MaxD=100001;
int Cost[MaxD],N,M;

int fun (const int x)  //算法实现。
{
	int s=0,m=0;
    for(int i=0;i<N;++i)
	{
		if(s+Cost[i]<=x)
			s+=Cost[i];
		else
            ++m,s=Cost[i];
	}
	return ++m;
}

int main()
{
	int max=-1,sum=0;
	scanf("%d %d",&N,&M);
	for(int i=0;i<N;++i)
	{
	    scanf("%d",&Cost[i]);
        if(Cost[i]>max)
			max=Cost[i];  //找出最大的月收入。
		sum+=Cost[i];      //算出总收入。
	}
     int left=max,right=sum,mia,k,ans;  //max<=x<=sum;x为二分查找对象。
	 while(left<=right)   //不断缩小范围。
	 {
		 mia=(left+right)/2; //中间值。
         k=fun(mia);  //返回数 和m 比较,小于m,缩小x,即right-1;否则增大x,即left+1;
		 if(k<=M)
		 {
			 right=mia-1;
		     ans=mia;
		 }
		 else
			 left=mia+1;
	 }
printf("%d\n",ans);
 return 0;
}

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

相关文章推荐

POJ-3273 Monthly Expense 解题报告

Description Farmer John is an astounding accounting wizard and has realized he might run out of m...

POJ_3273Monthly Expense解题报告。

Monthly Expense Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 7912  ...

G - Monthly Expense解题报告(黄杰)

G - Monthly Expense Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d &am...

ZOJ Monthly, July 2012浙大月赛解题报告

http://acm.zju.edu.cn/onlinejudge/showContestProblems.do?contestId=339 为了做浙大月赛,洗澡都没有去成,哎要等到下个星期...

ZOJ Monthly, June 2014 解题报告

A.Another Recurrence Sequence B.Gears 题目大意:有n个齿轮,一开始各自为一组,之后进行m次操作,包括以下4种类型: 1.合并两组齿轮,合并的...

浙大 ACM 解题报告

  • 2015-12-30 21:51
  • 835KB
  • 下载

POJ 3273 Monthly Expense(二分)

http://poj.org/problem?id=3273 Monthly Expense Time Limit: 2000MS   Memo...

HDU 2000-2099 解题报告.CHM

  • 2013-08-08 20:51
  • 831KB
  • 下载

HDU2501解题报告

  • 2014-07-10 10:44
  • 12KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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