Bear and Segment 01 (Linear Search 07)

#include<stdio.h>
#include<string.h>
int main()
{
    char ch[100000];
    int n,count=0,i,t,o=0,c=0;
    scanf("%d",&t);
    while(t--)
    {
        c = 0, o = 0, count=0;
        scanf("%s",&ch);
        n = strlen(ch);
        for(i=0; i<n-1; i++)
        {
            if((ch[i]=='0'&&ch[i+1]=='1')||(ch[i]=='1'&&ch[i+1]=='0'))
                count++;
            if(ch[i]=='0')
                o++;
            if(ch[i]=='1')
                c++;

        }
        if(ch[n-1]=='0')
            o++;
        else
            c++;

        if((count>2)||((ch[0]=='1')&&(ch[n-1]=='1')&&(o!=0))||(o==n))
            printf("NO\n");
        else
            printf("YES\n");
    }
    return 0;
}