题目链接:
http://codeforces.com/contest/877/problem/B
题解:
暴力区间更新
代码:
#include <map>
#include <cmath>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
const int maxn = 5000+10;
int num1[maxn],num2[maxn];
//num1表示a的前缀和,num2表示b的前缀和
int main(){
string s;
cin>>s;
map<char,int> mp;
met(num1,0),met(num2,0);
for(int i=0;i<s.size();i++){
if(s[i]=='a'&&i==0)
num1[i]=1;
else if(s[i]=='b'&&i==0)
num2[i]=1;
else if(s[i]=='a')
{
num1[i]=num1[i-1]+1;
num2[i]=num2[i-1];
}
else if(s[i]=='b')
{
num2[i]=num2[i-1]+1;
num1[i]=num1[i-1];
}
mp[s[i]]++;
}
int MAX=max(mp['b']?mp['a']+1:mp['a'],mp['b']);
int len=(int)s.size();
for(int i=0;i<len;i++){
for(int j=0;j<i;j++){
int ans1=num1[j];
int ans2=num2[i]-num2[j-1];
int ans3=num1[len-1]-num1[i-1];
if(ans1!=0&&ans2!=0||ans2!=0&&ans3!=0)
{
int ans=ans1+ans2+ans3;
MAX=max(MAX,ans);
}
}
}
printf("%d\n",MAX);
}