← 返回题目

题库练习 Vasya and String

← 上一题下一题 →

A10423 | $Vasya and String$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

High school student Vasya got a string of length $n$ as a birthday present. This string consists of letters 'a' and 'b' only. Vasya denotes beauty of the string as the maximum length of a substring (consecutive subsequence) consisting of equal letters. Vasya can change no more than $k$ characters of the original string. What is the maximum beauty of the string he can achieve?

输入格式

The first line of the input contains two integers $n$ and $k$ ( $1<=n<=100000,0<=k<=n$ ) — the length of the string and the maximum number of characters to change. The second line contains the string, consisting of letters 'a' and 'b' only.

输出格式

Print the only integer — the maximum beauty of the string Vasya can achieve by changing no more than $k$ characters.

输入输出样例

输入 #1

4 2
abba

输出 #1

输入 #2

8 1
aabaabaa

输出 #2

C++ 编辑器

输入

输出