PROB Broken Necklace

/*
ID:hejiek1
LANG: C
TASK:beads
*/
#include
#include
#define MAX     1000
int num;
char beads[MAX];
int input(void)
{
    FILE *fp=fopen("beads.in","r");
    fscanf(fp,"%d",&num);
    fscanf(fp,"%s",beads);
    return strlen(beads);
}
int findmax(char *beads,int len)
{
    int i,j,k,maxn,flag,maxmaxn=0;
    char buf,c;
    for(i=0;i        beads[len+i]=beads[i];
    for(j=0;j    {
        maxn=0;
        for(i=j,flag=1;i        {
             c=beads[i];
             if(flag&&c!='w')
             {
                buf=c;
                maxn++;
                flag=0;
             }
             else if(c==buf||c=='w')
                 maxn++;
             else break;
        }
        for(k=j-1,flag=1;k>=0;k--)
        {
             c=beads[k];
             if(flag&&c!='w')
             {
                buf=c;
                maxn++;
                flag=0;
             }
             else if(c==buf||c=='w')
                 maxn++;
             else break;
        }
        if(maxmaxn            maxmaxn=maxn;
    }
    return len>=maxmaxn?maxmaxn:len;
}
void output(int maxn)
{
    FILE *fp=fopen("beads.out","w");
    fprintf(fp,"%dn",maxn);
}
int main (int argc, char const* argv[]) {
    int length,maxn;
    length=input();
    maxn=findmax(beads,length);
    output(maxn);
    return 0;
}
</div>