B. Nikita and string

One day Nikita found the string containing letters “a” and “b” only.

Nikita thinks that string is beautiful if it can be cut into 3 strings (possibly empty) without changing the order of the letters, where the 1-st and the 3-rd one contain only letters “a” and the 2-nd contains only letters “b”.

Nikita wants to make the string beautiful by removing some (possibly none) of its characters, but without changing their order. What is the maximum length of the string he can get?

Input
The first line contains a non-empty string of length not greater than 5 000 containing only lowercase English letters “a” and “b”.

Output
Print a single integer — the maximum possible size of beautiful string Nikita can get.

Examples
input
abba
output
4
input
bab
output
2

题解：

前缀和+暴力枚举分割点
注意第一个分割点可以从0开始

代码：

#include <bits/stdc++.h>

using namespace std;

const int maxn = 5000+100;
int prea[maxn];
int preb[maxn];
string str;

int main()
{
    cin>>str;
    int siz = str.size();
    prea[0]=0;
    preb[0]=0;
    for(int i=1;i<=siz;i++)
    {
        prea[i]=prea[i-1]+(str[i-1]=='a');
        preb[i]=preb[i-1]+(str[i-1]=='b');
    }

    int ans = 0;
    for(int i=0;i<=siz;i++)
    {
       for(int j=i;j<=siz;j++)
       {
          ans = max(ans,prea[i]+preb[j]-preb[i]+prea[siz]-prea[j]);
       }
    }
    //ans = max(ans,max(prea[siz],preb[siz]));
    cout<<ans<<endl;
    return 0;
}