codeforces 676-C. Vasya and String(尺取)
来源:互联网 发布:c语言编写 玫瑰花 编辑:程序博客网 时间:2024/06/06 02:39
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”.
题目大意:
一个字符串只包含a和b,可以改变其中k个字符。求最大的美丽值。
(美丽值定义为子串中所含字符均相同的的最长子串的长度)
解题思路:
通过尺取,分别把k个字符全部改成a和全部改成b的最大美丽值求出来,然后比较一下大小即可。
#include<iostream>using namespace std;#define maxn 100005char s[maxn];int n,k;int cal(char x){ int l=0,r=0,cnt=0,ans=0; while(l<n&&r<n) { while((s[r]==x||cnt<k)&&r<n) { if(s[r]!=x) cnt++; r++; } ans=max(ans,r-l); while(s[l]==x&&l<=r) l++; l++; cnt--; } return ans;}int main(){ while(cin>>n>>k) { cin>>s; int ans=max(cal('a'),cal('b')); cout<<ans<<endl; } return 0;}
- codeforces 676-C. Vasya and String(尺取)
- codeforces 676C Vasya and String(尺取法)
- (尺取法)Codeforces 676C - Vasya and String
- Codeforces Round #354 (Div. 2)——C. Vasya and String(尺取)
- codeforces 676C C. Vasya and String 尺取法
- codeforces 676C Vasya and String
- Codeforces 676C Vasya and String
- codeforces 676C. Vasya and String
- Codeforces 676 C. Vasya and String
- 【CodeForces 676】C - Vasya and String
- codeforces 676C Vasya and String (尺取法)
- Codeforces 676C Vasya and String 尺取法
- Vasya and String(尺取 贪心)
- Codeforces Round #354 (Div. 2) C. Vasya and String 尺取
- codeforces #354 div.2 C &&676C Vasya and String
- Codeforces Round #354 (Div. 2)676C. Vasya and String
- Codeforces 676C Vasya and String (两点法)
- codeforces 676C Vasya and String 前缀数组+二分查找
- 2017 四川省赛 E.Longest Increasing Subsequence【思维+贪心】
- java基础(面试)
- 埃拉托斯特尼筛法 VS 欧拉筛法 (素数筛选) Java
- -webkit-tap-highlight-color
- 判断两个不带环链表是否相交?若相交,求入口点。
- codeforces 676-C. Vasya and String(尺取)
- Hihocoder 1426 E. What a Ridiculous Election (BFS)
- Android笔记(10)MD5加密
- 重要标签总结
- 51NOD1094 和为k的连续区间
- 2.4变动和最终变量(Volatile and Final Variables)
- springmvc数据回显(九)
- Spring注解配置定时任务<task:annotation-driven/>
- Java反射(8个)