/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 284.0 KiB
#2 Wrong Answer 4ms 284.0 KiB

Code

#include <stdio.h>
#include <string.h>
int maxConsecutiveOnes(char S[], int N, int K) {
    int maxcount = 0, left = 0, zerocount = 0;
    for (int right = 0; right < N; right++) {
        if (S[right] == '0') {
            zerocount++;
        }
        while (zerocount > K) {
            if (S[left] == '0') {
                zerocount--;
            }
            left++;
        }
        int windowsize = right - left + 1;
        if (windowsize > maxcount) {
            maxcount = windowsize;
        }
    }
    return maxcount;
}
void solve() {
    int N, K;
    scanf("%d %d", &N, &K);
    char S[N + 1];
    scanf("%s", S);
    printf("%d\n", maxConsecutiveOnes(S, N, K));
}
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1159 Binary String
Contest
Brain Booster #8
Language
C99 (GCC 13.2.0)
Submit At
2025-02-17 15:56:16
Judged At
2025-02-17 15:56:21
Judged By
Score
0
Total Time
4ms
Peak Memory
284.0 KiB