USACO section1.1 Broken Necklace

/*
ID: vincent63
LANG: C
TASK: beads 
*/
#include <stdio.h>
#include<stdlib.h>
#include<string.h>
int findmax(char s[],int n){
    int i,j,count,max,l,r;
    char left,right;
    max=0;
    count=0;
    int p;
    for(i=0,j=1;j<n;i++,j++){
        
        l=i;
        r=j;
        while(s[l]=='w'){
            l--;
            count++;
        }
        while(s[r]=='w'){
            r++;
            count++;
        }
        
        left=s[l];
        right=s[r];
        
        for(;l>=0;l--){
            if(s[l]==left||s[l]=='w'){
                count++;
            }else{
                break;
            }
        }
        for(;r<n;r++){
            if(s[r]==right||s[r]=='w'){
                count++;
            }else{
                break;
            }
        }
        if(count>max){
            max=count;
            p=i;
            //printf("%dth count:%d\n",p,count);
        }
        count=0;
    }
    if(max>n/2){
        return n/2;
    }else{
        return max;
    }
    
}
int main () {
    FILE *fin  = fopen ("beads.in", "r");
    FILE *fout = fopen ("beads.out", "w");
    
    int n;
    char buf[10];
    char res[10];
    fgets(buf,10,fin);
    n=atoi(buf); 
         
    char necklace[2*n+5];
    char buf2[n+1];
    
    fgets(necklace,n+1,fin);
    
    strcpy(buf2,necklace);
    
    strcat(necklace,buf2);
    int i;
    /*
    for(i=0;i<2*n;i++){
        printf("%c",necklace[i]);
    }
    printf("\n");
    */
    int max;
    max=findmax(necklace,2*n);
    
    //itoa(max,res,10);
    sprintf(res,"%d\n",max);
    fputs(res,fout);
    //printf("%d\n",max);
    
    return 0;
}