CF#877 B. Nikita and string（思维，暴力）

B. Nikita and string

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

Note

It the first sample the string is already beautiful.

In the second sample he needs to delete one of "b" to make it beautiful.

题意：给出一个只包含 ' a ' , ' b ' 的串，求一个最长的子串，这个字串划分为3部分，第一和第三部分只有 a 第二部分只有 b （每一部分都可为空串）

我们先用前缀后缀数组记录一下每一个 ' b '前后各还有多少个 ' a '，再n^2枚举第二部分b的起始和终止位置，使pre[ i ] + s + suf[ j ]最大即可 （s为从 i 到 j 字符 ' b ' 的个数）

还要注意特判全是a的串 0.0

#include <bits/stdc++.h>
using namespace std;

char a[5001];
int b[5001], c[5001];

int main(){
    while(scanf("%s", &a) == 1){
        int l = strlen(a);
        int sum = 0;
        memset(b, 0, sizeof b);
        memset(c, 0, sizeof c);
        for(int i = 0; i < l; i++){
            if(a[i] == 'b') b[i] = sum;
            else sum++;
        }
        sum = 0;
        for(int i = l-1; i >= 0; i--){
            if(a[i] == 'b') c[i] = sum;
            else sum++;
        }
        int maxi = -0x3f3f3f3f;
        for(int i = 0; i < l; i++){
            int s = 0;
            for(int j = i; j < l; j++){
                if(a[j] == 'a') continue;
                s++;
                if(b[i]+s+c[j] > maxi){
                    maxi = b[i]+s+c[j];
                }
            }
        }
        if(maxi == -0x3f3f3f3f) maxi = l;
        printf("%d\n", maxi);
    }
}