zoukankan      html  css  js  c++  java
  • CodeForces

    快乐二分

    用前缀和随便搞一下

    #include <cstdio>
    using namespace std;
    const int N = 100010;
    int p[N];
    int n, k, cnt = 0;
    inline int msum(int a, int b) {
        if (a < 0)
            a = 0;
        return (b - a - sum[b] + sum[a]);
    }
    
    inline bool judge(int s) {
        for (int i = 1; i <= n; i++) {
            if (p[i] == 1)
                continue;
            if (msum(i - s - 1, i - 1) + msum(i, i + s) >= k)
                return true;
        }
        return false;
    }
    
    int main() {
        scanf("%d %d", &n, &k);
        for (int i = 1; i <= n; i++) {
            scanf("%d", &p[i]);
            sum[i] = sum[i - 1] + p[i];
        }
        int l = 0, r = n / 2 + 1;
        while (l < r) {
            int mid = (l + r) / 2;
            if (judge(mid))
                r = mid;
            else
                l = mid + 1;
        }
        printf("%d
    ", l);
        return 0;
    }
  • 相关阅读:
    PAT甲级1137Final Grading
    晚测6
    模拟15
    模拟14
    模拟13
    晚测5
    晚测4
    模拟11
    7012. 2021.03.15【2021省赛模拟】十
    7011. 2021.03.13【2021省赛模拟】nonintersect
  • 原文地址:https://www.cnblogs.com/cminus/p/11963904.html
Copyright © 2011-2022 走看看