CodeForces - 676C C - Vasya and String

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
Note
In the first sample, Vasya can obtain both strings “aaaa” and “bbbb”.

In the second sample, the optimal answer is obtained with the string “aaaaabaa” or with the string “aabaaaaa”.
思路：尺取法维护一个串，找最大值，然后输出，具体解释在代码中

#include<bits/stdc++.h>
#define MAXX 100001
using namespace std;
char str[MAXX];
int main()
{
	int n,k;
	int l,r;
	int k1,k2;
	int maxx=0;
	cin>>n>>k;
	//getchar();
	cin>>str;
	//先对a处理，即串中全为b 
	l=0;r=0;k1=k;maxx=0;
	while(l<=r&&r<n)
	{
		if(str[r]=='a') k1--;//判断是否为a，若为 a，则把换成b，同时可操作数k减一； 
		while(k1<0)//当可操作数k为小于零时，要把左边界开始右移 
		{
			if(str[l]=='b') l++;//移动左边界，至左边碰到a， 
			else {
			l++;//将左边界移到a处 
			k1=0;//此时可操作数k由于开始小于零（说明多移一次），现在又把左边界移至a，即可变为零 ,我的理解是左边的a去掉，加上右边的a 
		    }
		}
		maxx=max(maxx,r-l+1);//每次移动完，记录串的最大值 
		r++;//右边界右移， 
	} 
	l=0;r=0;k2=k;
	while(l<=r&&r<n)
	{
		if(str[r]=='b') k2--;
		while(k2<0) 
		{
			if(str[l]=='a') l++;
			else {
			l++;
			k2=0;
			}
		}
		maxx=max(maxx,r-l+1);//cout<<maxx<<" "<<l<<" "<<r<<endl; 
		r++; 
	} 
	cout<<maxx<<endl; 
	return 0;
}