/ SeriousOJ /

Record Detail

Wrong Answer


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

Code

#include <stdio.h>

int maxConsecutiveOnes(int N, int K, const char* S) {
    int left = 0, right = 0, max_len = 0, count_zeros = 0;

    while (right < N) {
      
        if (S[right] == '0') {
            count_zeros++;
        }

       
        while (count_zeros > K) {
            if (S[left] == '0') {
                count_zeros--;
            }
            left++;
        }

        
        max_len = (right - left + 1) > max_len ? (right - left + 1) : max_len;

        right++;
    }

    return max_len;
}

int main() {
    int T;
    scanf("%d", &T);

    while (T--) {
        int N, K;
        scanf("%d %d", &N, &K);
        
        char S[N + 1];  
        scanf("%s", S);

        int result = maxConsecutiveOnes(N, K, S);

        printf("%d\n", result);
    }

    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 16:58:29
Judged At
2025-02-17 16:58:29
Judged By
Score
0
Total Time
5ms
Peak Memory
284.0 KiB