CodeForces 676C Vasya and String

最新推荐文章于 2021-10-27 20:36:10 发布

原创最新推荐文章于 2021-10-27 20:36:10 发布 · 262 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

尺取法

当前文章被收录于：

尺取法

2 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

探讨在一串由'a'和'b'组成的长度为n的字符串中，在允许更改不超过k个字符的前提下，如何通过算法找到最大长度的相同字符连续子串，并实现字符串美化。

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?

Input
The first line of the input contains two integers n and k (1 ≤ n ≤ 100 000, 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.

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

Examples
Input
4 2
abba
Output
4
Input
8 1
aabaabaa
Output
5

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+7;
char s[N];
int n,k;
int check(char tmp)
{
    int l=0,r=0,cnt=0,ma=0;
    while(r<n)
    {
        if(s[r]!=tmp)cnt++;
        r++;
        while(cnt>k&&l<=r)
        {
             if(s[l]!=tmp)cnt--;
            l++;
        }
        while(r<n&&s[r]==tmp)
            r++;
        ma=max(r-l,ma);
    }
    return ma;
}
int main()
{
    scanf("%d%d%s",&n,&k,s);
    printf("%d\n",max(check('a'),check('b')));
}