40分，求调！

#include<bits/stdc++.h>
using namespace std;
int f[2]={11,21},a[25*2500+10],n=0;
char tmp;
int read(){
    int ret=0,f=1;char ch=getchar();
    while (!isdigit(ch)) {if (ch=='-')f=-f;ch=getchar();}
    while (isdigit(ch)) ret=(ret<<3)+(ret<<1)+(ch&15),ch=getchar();
    return ret*f;
}
int main(){
    while(1){
        scanf("%c",&tmp);
        if(tmp=='E')break;
        else if(tmp=='W')a[n++]=1;
        else if(tmp=='L')a[n++]=0;
    }
    for(int i=0;i<2;i++){
        int w=0,l=0;
        for(int j=0;j<n;j++){
            w+=a[j];l+=1-a[j];
            if((max(w,l)>=f[i])&&abs(w-1)>=2){
                printf("%d:%d\n",w,l);w=l=0;
            }
        }
        printf("%d:%d\n",w,l);
        printf("\n");
    }
    return 0;
}