luogu P1042 乒乓球 模拟

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int tot1,tot2,score1_W,score1_L,score2_W,score2_L;
int res1[6000][3],res2[6000][3];
bool fnsh;
int main()
{
    int len;
    char s[30];
    while (scanf("%s",s) > 0)
    {
        len = strlen(s);
        for (int i = 0; i < len; i++)
        {
            if (s[i] == 'W')
            {
                score1_W++;
                score2_W++;
            }
            else if (s[i] == 'L')
            {
                score1_L++;
                score2_L++;
            }else if (s[i] == 'E')
            {
                fnsh = true;
                break;
            }
            if (max(score1_W,score1_L) >= 11 && max(score1_W,score1_L) - min(score1_W,score1_L) >= 2)
            {
                tot1++;
                res1[tot1][1] = score1_W;
                res1[tot1][2] = score1_L;
                score1_W = 0;
                score1_L = 0;
            }
            if (max(score2_W,score2_L) >= 21 && max(score2_W,score2_L) - min(score2_W,score2_L) >= 2)
            {
                tot2++;
                res2[tot2][1] = score2_W;
                res2[tot2][2] = score2_L;
                score2_W = 0;
                score2_L = 0;
            }
        }
        if (fnsh == true)
            break; 
    }
    tot1++;
    res1[tot1][1] = score1_W;
    res1[tot1][2] = score1_L;
    tot2++;
    res2[tot2][1] = score2_W;
    res2[tot2][2] = score2_L;
    for (int i = 1; i <= tot1; i++)
        printf("%d:%d
",res1[i][1],res1[i][2]);
    printf("
");
    for (int i = 1; i <= tot2; i++)
        printf("%d:%d
",res2[i][1],res2[i][2]);
    return 0;
}