codeforces 676C Vasya and String(尺取法)
来源:互联网 发布:海康威视远程配置域名 编辑:程序博客网 时间:2024/05/17 21:45
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 asubstring (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 andk (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 thank characters.
4 2abba
4
8 1aabaabaa
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".
解题思路:尺取法,注意要分为两种情况讨论,都转化为a或者都转化为b。
#include<bits/stdc++.h>using namespace std;typedef long long LL;typedef pair<int,int> PII;#define MP make_pair#define PB push_back#define AA first#define BB second#define OP begin()#define ED end()#define SZ size()#define cmin(x,y) x=min(x,y)#define cmax(x,y) x=max(x,y)const LL MOD = 1000000007;const double PI = acos(-1.);const double eps = 1e-9;char c[100005];int A[100005];int fa(int le,int re){return A[re]-A[le-1];}int fb(int le,int re){return re-le+1-fa(le,re);}int main(){int i,j,k,l,r;int n,m;while(~scanf("%d%d",&n,&m)){scanf("%s",c+1);A[0]=0;for(i=1;i<=n;i++)A[i]=A[i-1]+(c[i]=='a');//保存前n位有几个aint ans=m;//至少可以得到一个长度为m的字串l=1;r=1;while(l<=n) { while(r<=n && fa(l,r)<=m) { cmax(ans,r-l+1); r++; } l++; } l=1;r=1;while(l<=n) { while(r<=n && fb(l,r)<=m) { cmax(ans,r-l+1); r++; } l++; }cout<<ans<<"\n";}return 0;}
- codeforces 676C Vasya and String(尺取法)
- (尺取法)Codeforces 676C - Vasya and String
- codeforces 676C C. Vasya and String 尺取法
- codeforces 676C Vasya and String (尺取法)
- Codeforces 676C Vasya and String 尺取法
- Codeforces Round #354 (Div. 2) C Vasya and String(尺取法二分)
- Codeforces Round #354 (Div. 2) C. Vasya and String (尺取法)
- codeforces 676-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 #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 前缀数组+二分查找
- Codeforces 676 C Vasya and String【二分查找+预处理】
- 从支持异步并发编程的Web后端框架到数据存储服务的分布式一致性哈希路由
- 手机开发实战54——SMS介绍4
- 占坑
- 自定义圆形图片
- 手机开发实战55——EMS介绍1
- codeforces 676C Vasya and String(尺取法)
- 格力 大松KJFC230A空气净化器开机自动灯闪烁不工作是什么原因?
- Python--python爬虫神器PyQuery
- 二叉树的分层打印(二)
- Java多线程创建方式
- andriod eclipse 如何设置ndk-build也即NDK自动编译C/C++、JNI程序
- C++ primer 继承与动态绑定
- Caused by: android.os.TransactionTooLargeException总结
- 用CocoaPods做iOS程序的依赖管理