High school student Vasya got a string of length n as a birthday present. This string consists of letters 'a' and 'b' only. Vasya denotesbeauty 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 ≤ 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.
Print the only integer — the maximum beauty of the string Vasya can achieve by changing no more than k characters.
4 2 abba
4
8 1 aabaabaa
5
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".
题意:给你一个有n个数的数组,让你做一次交换,使得最大值和最小值的位置相距最大
题目链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=391010
解题思路:要么把1放到第一位,或者最后一位,要么是n放到第一位,或者最后一位,四种情况枚举即可
代码:
#include
#include
#include
#include
//abs()所在头文件
using namespace std;
int main()
{
int n,i,p1,p2,m;
while(~scanf("%d",&n)){
for(i=0;i