zoukankan      html  css  js  c++  java
  • Code Forces 645C Enduring Exodus

    C. Enduring Exodus
    time limit per test2 seconds
    memory limit per test256 megabytes
    inputstandard input
    outputstandard output
    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 n rooms 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.

    Examples
    input
    7 2
    0100100
    output
    2
    input
    5 1
    01010
    output
    2
    input
    3 2
    000
    output
    1

    先枚举人的位置,然后二分枚举人两侧的距离长度,

    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <stdio.h>
    #include <math.h>
    
    
    using namespace std;
    #define MAX 100000
    char b[MAX+5];
    int s[MAX+5];
    int n,k;
    int main()
    {
        scanf("%d%d",&n,&k);
        scanf("%s",b+1);
        s[0]=0;
        for(int i=1;i<=n;i++)
            s[i]=s[i-1]+(b[i]=='0'?1:0);
        int ans=MAX*10;
        for(int i=1;i<=n;i++)
        {
            if(b[i]=='1')
                continue;
            int l=1,r=n;
            while(l<r)
            {
                int mid=(l+r)/2;
                int ml=max(1,i-mid);
                int mr=min(n,i+mid);
                if(s[mr]-s[ml-1]-1>=k)
                    r=mid;
                else
                    l=mid+1;
            }
            ans=min(ans,l);
        }
        printf("%d
    ",ans);
        return 0;
    }
    
  • 相关阅读:
    wireshark 实用过滤表达式(针对ip、协议、端口、长度和内容)
    32:从1到n整数中1出现的次数
    31:连续子数组的最大和
    30:最小的K个数
    29:数组中出现次数超过一半的数字
    28:字符串的排列
    27:二叉搜索树与双向链表
    26:复杂链表的复制
    25:二叉树中和为某一个定值的路径
    24:二叉搜索树的后序遍历序列
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228701.html
Copyright © 2011-2022 走看看