#include<bits/stdc++.h>
using namespace std;
int n,ans=1e9,k1=1e9,k;
bool a[5005],b[5005];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		char c;
		cin>>c;
		if(c=='F'){
			a[i]=1;
		}
	}
	for(k=1;k<=n;k++){
		int num=0;
		memset(b,0,sizeof(b));
		for(int i=1;i<=n-k+1;i++){
			b[i]+=b[i-1];
			if((a[i]+b[i])%2==0){	
				b[i]=b[i]+1;
				b[i+k]=b[i+k]-1;
				num++;
			}
		}
		for(int i=n-k+2;i<=n;i++){
			b[i]+=b[i-1];
			if((a[i]+b[i])%2==0){
				num=1e9;break;
			}
		}
		if(ans>num){
			ans=num;
			k1=k;
		}
	}	 
	cout<<k1<<" "<<ans<<"\n";
	return 0;
}

只有十分

P2882 [USACO07MAR] Face The Right Way G

求助