题解 | 01序列

#include <iostream>
using namespace std;
const int N = 1e5+10;

int main() {
    int m,n;cin>>m;
    bool b[N]={0};
    int replace=0;
    for(int i=1;i<=m;i++)
        cin>>b[i];
    cin>>n;
    for(int i=1;i<=m;i++)
        if(!b[i]&&!b[i-1]&&!b[i+1])
        {
            replace++;
            b[i] = 1; 
        }
    if(replace>=n) cout<<"true";
    else cout<<"false";
    return 0;
}