Codeforces551C:GukiZ hates Boxes

C. GukiZ hates Boxes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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:

1. If i ≠ n, move from pile i to pile i + 1;
2. 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.

Examples

input

Copy

2 1
1 1

output

Copy

4

input

Copy

3 2
1 0 2

output

Copy

5

input

Copy

4 100
3 4 5 4

output

Copy

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 (1second) 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个学生，每个学生移除第i个石子需要花费i+1的时间（即走路的时间和移除石子的时间），问移除所有石子的最小时间是多少

分析：二分枚举所有的搬走石子的时间，最多为搬走的石子用的时间和（这里先不考虑走路的时间），然后在对于每一个枚举的情况判断是否可行。就是对于有石子的位置来说，判断走路的时间和搬走石子的时间会不会超过枚举的时间，会的话就需要增加一个人来搬，这个时候人除了走路的时间剩下的时间可以用于搬其他的石子，用于搬石子的时间就相应减少了这么多。接着继续判断下一个位置和搬走这个位置的石子的时间会不会超，重复之前的操作。如果人数为负或者人用完了石子还没搬完，时间就不可行。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
ll a[maxn];
int n,m;
int judge(ll x)
{
    ll tot = 0;
    int cnt = m;
    for(int i = 1; i <= n; i++)
    {
        if(a[i])
        {
            tot += a[i];
        while(tot + i > x)
        {
            tot -= (x - i);
            cnt--;
            if(cnt < 0)return 0;
        }
        }

    }
    if(cnt == 0)return tot <= 0;
    return 1;
}
int main()
{
    cin>>n>>m;
    ll sum = 0;
    for(int i = 1; i <= n; i++)
    {
        cin>>a[i];
        sum += a[i];
    }
    ll res = 0;
    ll l = 1,r = sum + n;
    while(l <= r)
    {
        ll mid = (l + r) / 2;
        if(judge(mid))
        {
            r = mid - 1;
            res = mid;
        }
        else
            l = mid + 1;
    }
    cout<<res<<endl;
    return 0;
}