题解 | 01序列

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int m;
    cin>>m;
    vector<int>a(m+1);
    for(int i=1;i<=m;i++)
    {
        cin>>a[i];
    }
    int n;
    cin>>n;
    int cnt = 0;
    int res = 0;
    int l = 1,r=m;
    if(a[0]==0)
    {
        while(a[l]==0)l++,cnt++;
        res += cnt/2;
    }
    cnt = 0;
    if(a[m]==0)
    {
        while(a[r]==1)r--,cnt++;
        res += cnt/2;
    }
    cnt = 0;
    for(int i=l;i<=r;i++)
    {
        if(a[i]==0)cnt++;
        else
        {
            res += (cnt-1)/2;
            cnt = 0;
        }
    }

    if(res>=n)
    {
        cout<<"true\n";
    }
    else 
    {
        cout<<"false\n";
    }
    return 0;
}