POJ 3273

原创 2016年10月25日 08:27:54

Time Limit: 2000MS   Memory Limit: 65536KB   64bit IO Format: %lld & %llu

 Status

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

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>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 100010;
int a[N];
int judge(int x);
int n, m;


int main()
{


    while(scanf("%d %d", &n, &m)!=EOF)
    {
        int sum=0;
        for(int i=1; i<=n; i++)
        {
            scanf("%d", &a[i]);
            sum+=a[i];
        }
        int l=0, r=sum, mid;
        while(l<=r)
        {
            mid=(l+r)/2;
            if(judge(mid))
            {
                r=mid-1;
            }
            else
            {
                l=mid+1;
            }
        }
        printf("%d\n",l);
    }
    return 0;
}


int judge(int x)
{
    int cnt=0, sum=0;
    for(int i=1; i<=n; i++)
    {
        sum+=a[i];
        if(sum==x)
        {
            if(i==n)
            {
                break;
            }
            sum=0;
            cnt++;
        }
        else if(sum>x)
        {
            sum=a[i];
            cnt++;
        }
        if(a[i]>x||cnt>m-1)
        {
            return 0;
        }
    }
    if(cnt<=m-1)
    {
        return 1;
    }
    return 0;
}


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

相关文章推荐

POJ3273-Monthly Expense

  • 2011年07月31日 23:05
  • 6KB
  • 下载

POJ_3273_Monthly Expense

poj 3273 Monthly Expense Farmer John is an astounding accounting wizard and has realized he might ru...
  • Mrx_Nh
  • Mrx_Nh
  • 2016年10月01日 03:17
  • 128

POJ 3273 Monthly Expense(二分)

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

ZOJ3273 POJ3832 HDU3265 Posters

线段树求矩形并。 由于数据范围不大,而都是整数,所以不需要离散化。算法思想是从左往右扫描,node.length保存的是整条y轴可用的长度;LINE中的flag用于记录矩形的左边和右边,左边为1,进...
  • neofung
  • neofung
  • 2012年01月23日 23:14
  • 1188

POJ3273:Monthly Expense(二分)

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

poj~3273(二分法)

poj3273 第一个做的二分法,以前一直以为二分法只能用在查找上,没想到二分那么神奇,还可以这样用。 该题的意思是:给你n个数,让你分成m分,要求分得各组的花费之和应该尽可能地小,然后输出花费最大的...

POJ 3273-Monthly Expense(二分法-最小化最高花费)

Monthly Expense Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 24397   Accepted:...
  • MIKASA3
  • MIKASA3
  • 2017年02月09日 14:24
  • 159

POJ 3273 Monthly Expense

题目的大意是:给你两个数n,m。m代表给你m个数字,n代表最多分成n组。求每组连续数字最小的和。 一开始一般大家都会想到是dp但是这是不对的、、要不就不会放在计算方法的分类之中了啊、、disscus...

POJ-3273 Monthly Expense 解题报告

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

POJ3273:Monthly Expense

POJ3273:Monthly Expense 题目大意:给定n个数据,将这n个数据分成m组,使得每组数据值和尽可能的小,输出所有组中最大的和。解法很巧妙,开始的时候没想到用二分法解,想暴力枚举过。...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 3273
举报原因:
原因补充:

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