浪费您的时间了qwq（dbq

虽然问题很简单但是不会改（（（

谢谢谢谢

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath> 

using namespace std;

const int A = 1e7;
char data;
int tot = 0,cnt1 = 0,cnt2 = 0;
int a = 0,b = 0,x = 0,y = 0;
int a11[A],b11[A],a21[A],b21[A];

int main() {
	while(scanf("%c",&data)){
		if(data == 'E')break;
		else if(data == 'W'){a ++;x ++;}
		else if(data == 'L'){b ++;y ++;}
		else continue;
		if((a >= 11 || b >= 11) && (abs(a - b) >= 2)){a11[cnt1] = a;b11[cnt1] = b;cnt1 ++;a = 0;b = 0;continue;}
		if((x >= 21 || y >= 21) && (abs(x - y) >= 2)){a21[cnt2] = x;b21[cnt2] = y;cnt2 ++;x = 0;y = 0;continue;}
	}
	for(int i = 0;i < cnt1;i ++)printf("%d:%d\n",a11[i],b11[i]);
	printf("%d:%d\n",a,b);
	puts("");
	for(int i = 0;i < cnt2;i ++)printf("%d:%d\n",a21[i],b21[i]);
	printf("%d:%d\n",x,y);
	puts("");
	return 0;
}