CodeForces - 551C GukiZ hates Boxes(二分+贪心)

描述

Professor GukiZ is concerned about making his way to school, because
massive piles of boxes are blocking his way.

In total there are n piles of boxes, arranged in a line, from left to
right, i-th pile (1 ≤ i ≤ n) containing ai boxes. Luckily, m students
are willing to help GukiZ by removing all the boxes from his way.
Students are working simultaneously. At time 0, all students are
located left of the first pile. It takes one second for every student
to move from this position to the first pile, and after that, every
student must start performing sequence of two possible operations,
each taking one second to complete. Possible operations are:

If i ≠ n, move from pile i to pile i + 1; If pile located at the
position of student is not empty, remove one box from it. GukiZ’s
students aren’t smart at all, so they need you to tell them how to
remove boxes before professor comes (he is very impatient man, and
doesn’t want to wait). They ask you to calculate minumum time t in
seconds for which they can remove all the boxes from GukiZ’s way. Note
that students can be positioned in any manner after t seconds, but all
the boxes must be removed.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 105), the
number of piles of boxes and the number of GukiZ’s students.

The second line contains n integers a1, a2, … an (0 ≤ ai ≤ 109)
where ai represents the number of boxes on i-th pile. It’s guaranteed
that at least one pile of is non-empty.

Output

In a single line, print one number, minimum time needed to remove all
the boxes in seconds.

input

2 1
1 1

output

4

input

3 2
1 0 2

output

5

input

4 100
3 4 5 4

output

5

Note

First sample: Student will first move to the first pile (1 second),
then remove box from first pile (1 second), then move to the second
pile (1 second) and finally remove the box from second pile (1
second).

Second sample: One of optimal solutions is to send one student to
remove a box from the first pile and a box from the third pile, and
send another student to remove a box from the third pile. Overall, 5
seconds.

Third sample: With a lot of available students, send three of them to
remove boxes from the first pile, four of them to remove boxes from
the second pile, five of them to remove boxes from the third pile, and
four of them to remove boxes from the fourth pile. Process will be
over in 5 seconds, when removing the boxes from the last pile is
finished.

思路

先说题意，在一个坐标轴上有n个位置，有些位置上放着石头m个人要去搬石头，第二行给出了这n个位置上面有多少个石头，问这几个人搬完这些石头，最少用多少秒可以搬完，刚开始每个人都在0这个位置，移动一个格子花费1，搬一个石头花费1.

我们可以用二分的思想来做，枚举搬完石头的时间，问题就在于如何判断给的时间是否可以搬完石头，我们从最后一个位置开始考虑,让每一个人贪心的去搬石头，当当前位置有石头就搬走，并且在给的时间减去这个搬石头的花费，最后如果可以搬完就返回1，否则为0

代码

#include <cstdio>
#include <cstring>
#include <cctype>
#include <stdlib.h>
#include <string>
#include <map>
#include <iostream>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long ll;
const ll N=1e5+20;
ll n,m;
ll a[N],b[N];
ll judge(ll x)//x为给的秒数
{
    for(ll i=1; i<=n; i++)b[i]=a[i];
    ll j=n;
    for(ll i=1; i<=m; i++)
    {
        ll w=x;
        while(b[j]==0)
        {
            j--;
            if(j==0) return 1;
        }
        w-=j;
        if(w<=0)return 0;
        while(w>=b[j])
        {
            w-=b[j];
            j--;
            if(j==0)return 1;
            while(b[j]==0)
            {
                j--;
                if(j==0)return 1;
            }
        }
        b[j]-=w;
        while(b[j]==0)
        {
            j--;
            if(j==0) return 1;
        }
    }
    return 0;
}
int main()
{
    scanf("%lld%lld",&n,&m);
    for(ll i=1; i<=n; i++)
    {
        scanf("%lld",&a[i]);
    }
    ll l=0,r=1e18;
    while(l<r)
    {
        ll mid=(l+r)>>1;
        if(judge(mid))
            r=mid;
        else
            l=mid+1;
    }
    printf("%lld\n",l);
    return 0;
}