CF1146A.Love "A"

入门

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Alice has a string ss. She really likes the letter "a". She calls a string good if strictly more than half of the characters in that string are "a"s. For example "aaabb", "axaa" are good strings, and "baca", "awwwa", "" (empty string) are not.

Alice can erase some characters from her string ss. She would like to know what is the longest string remaining after erasing some characters (possibly zero) to get a good string. It is guaranteed that the string has at least one "a" in it, so the answer always exists.

Alice 有一个字符串 ss。她非常喜欢字母 “a”。如果一个字符串中 “a” 的个数严格大于该字符串长度的一半,则称这个字符串为好字符串。例如,“aaabb”、“axaa” 是好字符串,而 “baca”、“awwwa”、""(空字符串)则不是。

Alice 可以从她的字符串 ss 中删除一些字符(也可以不删)。她想知道:在删除若干字符(可能为零)后,能得到的最长的好字符串的长度是多少?题目保证字符串 ss 中至少包含一个 “a”,因此答案一定存在。

输入格式

The first line contains a string ss (1≤∣s∣≤501 \leq |s| \leq 50) consisting of lowercase English letters. It is guaranteed that there is at least one "a" in ss.

第一行包含一个字符串 ss(1≤∣s∣≤501 \leq |s| \leq 50),由小写英文字母组成。保证 ss 中至少有一个字符 "a"。

输出格式

Print a single integer, the length of the longest good string that Alice can get after erasing some characters from ss.

输出一个整数,表示爱丽丝从字符串 ss 中删除若干字符后所能得到的最长“好字符串”的长度。

输入输出样例

  • 输入#1

    xaxxxxa

    输出#1

    3
  • 输入#2

    aaabaa

    输出#2

    6

说明/提示

In the first example, it's enough to erase any four of the "x"s. The answer is 33 since that is the maximum number of characters that can remain.

In the second example, we don't need to erase any characters.

在第一个例子中,只需删除任意四个“x”即可。答案为 33,因为这是可以保留的最多字符数量。

在第二个例子中,我们无需删除任何字符。

输入解题思路,AI测评打分。不知道怎么写?

首页