DHU.OJ乒乓球＜字符串＞

 

 

 AC代码：

#include<iostream>
#include<cstdio>

using namespace std;
int a[65000];
void tongji(int x);
int len;
int main()
{

    char c;
    while(cin>>c)
    {
        switch (c)
        {
        case 'W':
            a[len++] = 1;
            break;
        case'L':
            a[len++] = 0;
            break;
        default:
            tongji(11);
            cout << endl;
            tongji(21);

            len = 0;
            if (cin.eof());

            else
            
                printf("\n");
            
        }
        
       

    }


    return 0;
}
void tongji(int x)
{

    int w = 0, l = 0;
    for (int i = 0; i < len; i++)
    {
        if (a[i])
        {
            w++;
        }
        else
        {
            l++;
        }
        if (l - w >= 2 && l >= x)
        {
            printf("%d:%d\n", w, l);
            w = l = 0;//还原成0
        }
        if (w - l >= 2 && w >= x)
        {
            printf("%d:%d\n", w, l);
            w = l = 0;
        }
    }
    printf("%d:%d\n", w, l);//关键点 最后一组不满11分Or 21分 输出

}