【CF961B】Lecture Sleep 尺取法

链接

传送门

代码

用尺取法的时候还是要注意边界条件的判读，不要出现漏取或者是越界的情况

#include <cstdio>
#include <algorithm>
#include <cctype>

const int N = 1e5 + 10;
int n, k, a[N];

inline int read(){
    int x = 0; char ch = getchar();
    while (!isdigit(ch)){ch = getchar();}
    while (isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48); ch = getchar();}
    return x;
}

int main() {
    n = read(), k = read();
    for (int i = 1; i <= n; ++i) a[i] = read();
    int res = 0, sum = 0;

    for (int i = 1, op; i <= n; ++i) {
        op = read();
        if (op == 1){
            res += a[i];
            a[i] = 0;
        }
    }

    int l = 0, r = 0;
    int max_sum = a[0];
    while (r < n){
        if (r - l + 1 >= k){
            sum -= a[l++];
        }
        else{
            sum += a[++r];
            max_sum = std::max(max_sum, sum);
        }
    }
    printf("%d\n", res + max_sum);
    return 0;
}