P1042 [NOIP2003 普及组] 乒乓球

坑点1：E会在任意位置出现， 不一定是结尾。
坑点2：输赢只差必须大于等于2场
坑点3：读到E时，不论比分是否为零，都要输出

字符串模拟版本：

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double


void solve() {
    
    string s;
    char c = cin.get();
    while (c != 'E') {
    
        if (c == 'W' || c == 'L') s += c;
        c = cin.get();
    }

    int w = 0, l = 0;

    for (int i = 0; i < s.size(); i++) {
    
        if (s[i] == 'W') {
    
            w++;
        } else if (s[i] == 'L') {
    
            l++;
        }

        if (abs(w - l) >= 2 && (w >= 11 || l >= 11)) {
    
            cout << w << ":" << l << "\n";
            w = l = 0;
        }
    }
    cout << w << ":" << l << "\n\n";
    w = l = 0;

    for (int i = 0; i < s.size(); i++) {
    
        if (s[i] == 'W') {
    
            w++;
        } else if (s[i] == 'L') {
    
            l++;
        }

        if (abs(w - l) >= 2 && (w >= 21 || l >= 21)) {
    
            cout << w << ":" << l << "\n";
            w = l = 0;
        }
    }
    cout << w << ":" << l << "\n";
       
}

int32_t main() {
    
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int tt(1);
    //std::cin >> tt;

    while (tt--) {
    
        solve();
    }

    return 0;
}

数组模拟版本：

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double


constexpr int N = 2500 * 30;
int win[N];

void solve() {
    
    char c = cin.get();
    int tot = 0;
    while (c != 'E') {
    
        if (c == 'W') {
    
            win[tot++] = 1;
        } else if (c == 'L') {
    
            win[tot++] = 2;
        }
        c = cin.get();
    }

    int w = 0, l = 0;

    for (int i = 0; i <= tot; i++) {
    
        if (win[i] == 1) {
    
            w++;
        } else if (win[i] == 2) {
    
            l++;
        }

        if (i == tot || abs(w - l) >= 2 && (w >= 11 || l >= 11)) {
    
            cout << w << ":" << l << "\n";
            w = l = 0;
        }
    }
    cout << "\n";

    for (int i = 0; i <= tot; i++) {
    
        if (win[i] == 1) {
    
            w++;
        } else if (win[i] == 2) {
    
            l++;
        }

        if (i == tot || abs(w - l) >= 2 && (w >= 21 || l >= 21)) {
    
            cout << w << ":" << l << "\n";
            w = l = 0;
        }
    }
    cout << "\n";
       
}

int32_t main() {
    
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int tt(1);
    //std::cin >> tt;

    while (tt--) {
    
        solve();
    }

    return 0;
}