Codeforces 965D

最新推荐文章于 2020-02-07 09:02:36 发布

做不完的ACM

最新推荐文章于 2020-02-07 09:02:36 发布

阅读量333

点赞数

分类专栏：网络流前缀和优化DP 二分弱鸡的日常 CF日常

本文链接：https://blog.csdn.net/qq_36876305/article/details/80101691

版权

CF日常同时被 3 个专栏收录

32 篇文章 0 订阅

订阅专栏

弱鸡的日常

17 篇文章 0 订阅

订阅专栏

二分

8 篇文章 0 订阅

订阅专栏

题目链接：http://codeforces.com/contest/965/problem/D

A lot of frogs want to cross a river. A river is $w$ units width, but frogs can only jump $l$ units long, where $l < w$ . Frogs can also jump on lengths shorter than $l$

. but can't jump longer. Hopefully, there are some stones in the river to help them.

The stones are located at integer distances from the banks. There are $a_{i}$

stones at the distance of

i

units from the bank the frogs are currently at. Each stone can only be used once by one frog, after that it drowns in the water.

What is the maximum number of frogs that can cross the river, given that then can only jump on the stones?

Input

The first line contains two integers $w$

and

l

(

1 \leq l < w \leq 10^{5}

) — the width of the river and the maximum length of a frog's jump.

The second line contains $w - 1$

integers

a_{1}, a_{2}, \dots, a_{w - 1}

(

0 \leq a_{i} \leq 10^{4}

), where

a_{i}

is the number of stones at the distance

i

from the bank the frogs are currently at.

Output

Print a single integer — the maximum number of frogs that can cross the river.

Examples

Input

Copy

10 5
0 0 1 0 2 0 0 1 0

Output

Copy

Input

Copy

10 3
1 1 1 1 2 1 1 1 1

Output

Copy

Note

In the first sample two frogs can use the different stones at the distance $5$

, and one frog can use the stones at the distances

3

and then

8

In the second sample although there are two stones at the distance $5$

, that does not help. The three paths are:

0 \to 3 \to 6 \to 9 \to 10

0 \to 2 \to 5 \to 8 \to 10

0 \to 1 \to 4 \to 7 \to 10

题解：方法一：二分答案，然后利用前缀和chec

方法二：最大流最小割定理，一定是删除连续的某段这是最小割。求出最小割即为答案。

#include <bits/stdc++.h>

using namespace std;
using ll = long long ;
const int N = 1E5 + 7;
int pre[N];
int w, l;
int sum(int l, int r)
{
    return pre[r]-pre[l-1];
}
bool ck(int k)
{
    for(int i = 1;i + l - 1 < w;i ++){
        if(sum(i, i + l - 1) < k) return 0;
    }
    return 1;
}
int main()
{
    scanf("%d %d", &w, &l);
    for(int i = 1;i < w;i ++) {
        scanf("%d", &pre[i]);
        pre[i] += pre[i-1];
    }
    int L = 0, R = pre[w-1];
    while(L <= R) {
        int mid = (L + R) / 2;
        if(ck(mid)) L = mid + 1;
        else R = mid - 1;
    }
    printf("%d\n", R);
    return 0;
}