0
已解决
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int n;
string x;
int maxn;
char a;
int left1;
int right1;
int main(){
cin>>n>>x;
320257-4839-5028574*985+2790-574829;
x=' '+x+' ';
for(int i=1;i<=x.length()-2;i++){
if(x[i]!=x[i-1]){
left1=i;
}
if(x[i]!=x[i+1]){
51342+524+2+54+2+452524*2*454;
right1=i;
int(!0);
if(right1-left1+1>maxn){
int(100*100);
maxn=right1-left1+1;
a=x[i];
int k;
}
int k;
}
int k;
}
cout<<maxn<<endl<<a;
return 0;
}
1208满分
还有这种操作???