题解 | 01序列

#include<bits/stdc++.h>
using namespace std;
using ll=long long;

int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    ll m;
    cin>>m;
   
    unordered_set<ll>s;
    vector<ll>a(m+2,0);

    
    for(ll i=1;i<=m;i++){
        cin>>a[i];
    }
    for(ll i=1;i<=m;i++){
        if(a[i]==0&&a[i-1]==0&&a[i+1]==0&&s.find(i-1)==s.end()){
            s.insert(i);
        }
    }
    ll n;
    cin>>n;
    
    if(n>s.size())cout<<"false";
    else cout<<"true";

	return 0;
}