sdnuoj 1018.三国杀

字符串+判断输赢

#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <stdlib.h>
#include <sstream>
#include <map>
#include <set>
typedef long long ll;
using namespace std;
int ar[10005];
int main()
{
    
    
    string s;
    int n;
    int k = 0;
    int j = 0;
    int sum = 0;
    cin>>s;
    n = s.size();//求string的长度；
    for(int i = 0; i<n; i++)
    {
    
    
        if(s[i] == 'W')
            k++;
        if(s[i] == 'L')
            j++;
        if(k==3)
        {
    
    
            sum++;
            k = 0;
            j = 0;
        }
        else if(j==3)
        {
    
    
            k = 0;
            j = 0;
        }
    }
    cout<<sum;
    return 0;
}