Untitled

mail@pastecode.io avatar
unknown
plain_text
a month ago
526 B
2
Indexable
Never
#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int t; cin>>t;
	while (t--) {
	    long n, k; cin >> n >> k;
	    long arr[n];
	    long curr = 0;
	    for (long i=0; i<n; i++) {
	        cin >> arr[i];
	    }
	    for (long i=0; i<k; i++) {
	        if (arr[i]%2) curr++; 
	    }
	    long ans = 0;
	    if (curr) ans++; 
	    for (long i=k; i<n; i++) {
	        if (arr[i-k]%2) curr--;
	        if (arr[i]%2) curr++;
	        if (curr) ans++;
	    }
	    cout << ans << "\n";
	}
	return 0;
}