题解 | 01序列

#include <stdio.h>
int main() 
{
    int n,t,count=0,print=0;
    scanf("%d",&n);
    int a[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    scanf("%d",&t);
    for(int j=0;j<n;j++)
    {
        if(count>=3&&(j<n-1&&a[j+1]==1))
        {
            if(count%2==0)
            {
                print+=count/2-1;
            }
            else 
            {
                print+=count/2;
            }
            
        }
        else if(count>=3&&j==n-1&&a[j]==0)
        {
            count++;
            if(count%2==0)
            {
                print+=count/2-1;
            }
            else 
            {
                print+=count/2;
            }
            break;
        }
        else if(count>=3&&j==n-1&&a[j]==1)
        {
            if(count%2==0)
            {
                print+=count/2-1;
            }
            else 
            {
                print+=count/2;
            }
            break;
        }
        if(a[j]==0)
        {
            count++;
            continue;
        }
        else
        {
            count=0;
            continue;
        }
    }
    if(t<=print)
    {
        printf("true");
    }
    else
    {
        printf("false");
    }
    return 0;
}