Educational Codeforces Round 55 (Rated for Div. 2) B. Vova and Trophies(思维模拟)

#include <bits/stdc++.h>
using namespace std;
int n;
string str;

int main()
{
	scanf("%d",&n);
	cin>>str;
	int cnt = 0, Gcnt = 0, Scnt = 0, sum;
	for(int i=0;i<n;i++){
		if(str[i] == 'G') Gcnt ++;
	}
	for(int i=0;i<n;i++){
		if(str[i] == 'S'){
			Scnt ++;
			sum = 0;
			int l = i - 1, r = i + 1;
			for(int j=i-1;j>=0;j--){
				if(str[j] == 'G') sum ++;
				else break;
			}
			for(int j=i+1;j<n;j++){
				if(str[j] == 'G') sum ++;
				else break;
			}
			if(Gcnt > sum) sum ++;   // 判断能否把S替换成G
			cnt = max(cnt, sum);
		}
	}
	if(Scnt == 0) cnt = n;
	if(Scnt == 1) cnt = n - 1;
	printf("%d\n", cnt);
	return 0;
}