题解

#include<bits/stdc++.h>
using namespace std;
const int N=2501*25+5;
char s;
int a[N];
int w,l,n,f[3]={0,11,21};
int main()
{
while(1){
cin>>s;
if(s=='E') break;
else if(s=='W') a[n]=1;
else if(s=='L') a[n]=0;
}
for(int j=1;j<=2;j){
w=0,l=0;
for(int i=1;i<=n;i){
if(a[i]) w++;
else l++;
if(max(w,l)>=f[j]&&abs(w-l)>=2){
cout<<w<<':'<<l<<endl;
w=0,l=0;
}
}
cout<<w<<':'<<l<<endl;
cout<<endl;
}

return 0;

}