CodeForces 645C（最大化最小值问题）

P - P

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 645C

Description

In an attempt to escape the Mischievous Mess Makers' antics, Farmer John has abandoned his farm and is traveling to the other side of Bovinia. During the journey, he and his k cows have decided to stay at the luxurious Grand Moo-dapest Hotel. The hotel consists of nrooms located in a row, some of which are occupied.

Farmer John wants to book a set of k + 1 currently unoccupied rooms for him and his cows. He wants his cows to stay as safe as possible, so he wishes to minimize the maximum distance from his room to the room of his cow. The distance between rooms i and j is defined as |j - i|. Help Farmer John protect his cows by calculating this minimum possible distance.

Input

The first line of the input contains two integers n and k (1 ≤ k < n ≤ 100 000) — the number of rooms in the hotel and the number of cows travelling with Farmer John.

The second line contains a string of length n describing the rooms. The i-th character of the string will be '0' if the i-th room is free, and '1' if the i-th room is occupied. It is guaranteed that at least k + 1 characters of this string are '0', so there exists at least one possible choice of k + 1 rooms for Farmer John and his cows to stay in.

Output

Print the minimum possible distance between Farmer John's room and his farthest cow.

Sample Input

Input

7 2
0100100

Output

2

Input

5 1
01010

Output

2

Input

3 2
000

Output

1

解体思路:这类题,典型思想就是二分,时间复杂度n*logn;枚举人的位置，二分最远距离。

代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[100010];
int sum[100010];
int n,k; 
int check(int p,int dis)  
{  
    int l = max(1, p - dis);  
    int r = min(n, p + dis);  
    return (sum[r] - sum[l - 1] - 1) >= k;  //要减去人的位置 
}  
int main(){
	int i,ans;
	while(scanf("%d%d",&n,&k)!=EOF){
		sum[0]=0;
		ans=0x3f3f3f3f;
		getchar();
	for (i = 1; i <= n; i++){
		scanf("%c",&s[i]);
		sum[i] = sum[i - 1] + (s[i] == '0'); 
	}
		for(i=1;i<=n;i++){
			if(s[i]=='0'){
			int l=1,r=n;
		      while (l < r)  //枚举牛的最远距离 
             {  
               int mid = (l + r) / 2;  
               if (check(i,mid)) r = mid;  
               else l = mid + 1;  
             } 
			 ans=min(ans,r); 
		}
	}
	 printf("%d\n",ans);
	}
}