C 解法, 执行用时: 2ms, 内存消耗: 372KB, 提交时间: 2020-07-05

#include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    int count=0,m,x;
    int flag = 0;   //0 | x x ... x | 0
       
    while(n>0)
    {
        scanf(" %d",&x);
        if(x == 0) flag++;
        if(flag == 3)
        {
            flag = 0;
            count++;
        }
           
        n--;
    }
    if(flag == 2) count++;  // x 0 0 | 0
       
    scanf("%d",&m);
    if(m > count) printf("false\n");
    else printf("true\n");
       
    return 0;
}

C 解法, 执行用时: 2ms, 内存消耗: 376KB, 提交时间: 2020-07-29

#include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    int count=0,m,x;
    int flag = 0;   //0 | x x ... x | 0
        
    while(n>0)
    {
        scanf(" %d",&x);
        if(x == 0) flag++;
        if(flag == 3)
        {
            flag = 0;
            count++;
        }
            
        n--;
    }
    if(flag == 2) count++;  // x 0 0 | 0
        
    scanf("%d",&m);
    if(m > count) printf("false\n");
    else printf("true\n");
        
    return 0;
}