C. An impassioned circulation of affection
来源:互联网 发布:微商软件工作室 编辑:程序博客网 时间:2024/05/16 08:51
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!
Still unsatisfied with the garland, Nadeko decided to polish it again. The garland has n pieces numbered from 1 to n from left to right, and the i-th piece has a colour si, denoted by a lowercase English letter. Nadeko will repaint at most m of the pieces to give each of them an arbitrary new colour (still denoted by a lowercase English letter). After this work, she finds out all subsegments of the garland containing pieces of only colour c — Brother Koyomi's favourite one, and takes the length of the longest among them to be the Koyomity of the garland.
For instance, let's say the garland is represented by "kooomo", and Brother Koyomi's favourite colour is "o". Among all subsegments containing pieces of "o" only, "ooo" is the longest, with a length of 3. Thus the Koyomity of this garland equals 3.
But problem arises as Nadeko is unsure about Brother Koyomi's favourite colour, and has swaying ideas on the amount of work to do. She has q plans on this, each of which can be expressed as a pair of an integer mi and a lowercase letter ci, meanings of which are explained above. You are to find out the maximum Koyomity achievable after repainting the garland according to each plan.
The first line of input contains a positive integer n (1 ≤ n ≤ 1 500) — the length of the garland.
The second line contains n lowercase English letters s1s2... sn as a string — the initial colours of paper pieces on the garland.
The third line contains a positive integer q (1 ≤ q ≤ 200 000) — the number of plans Nadeko has.
The next q lines describe one plan each: the i-th among them contains an integer mi (1 ≤ mi ≤ n) — the maximum amount of pieces to repaint, followed by a space, then by a lowercase English letter ci — Koyomi's possible favourite colour.
Output q lines: for each work plan, output one line containing an integer — the largest Koyomity achievable after repainting the garland according to it.
6koyomi31 o4 o4 m
365
15yamatonadeshiko101 a2 a3 a4 a5 a1 b2 b3 b4 b5 b
3457812345
10aaaaaaaaaa210 b10 z
1010
In the first sample, there are three plans:
- In the first plan, at most 1 piece can be repainted. Repainting the "y" piece to become "o" results in "kooomi", whose Koyomity of 3is the best achievable;
- In the second plan, at most 4 pieces can be repainted, and "oooooo" results in a Koyomity of 6;
- In the third plan, at most 4 pieces can be repainted, and "mmmmmi" and "kmmmmm" both result in a Koyomity of 5.
#include<bits/stdc++.h>#define maxn 20100using namespace std;int n,m,q;char str[maxn],s;///尺取法int solve(char x){ int l=0,r=0,ans=0,cnt=0; while(l<n&&r<n) { while((str[r]==x||cnt<m)&&r<n) { if(str[r]!=x) cnt++; r++; } ans=max(ans,r-l); while(str[l]==x&&l<=r) l++; l++; cnt--; } return ans;}int main(){ cin>>n; cin>>str; cin>>q; for(int i=0;i<q;i++) { cin>>m>>s; cout<<solve(s)<<endl; } return 0;}
- 814C An impassioned circulation of affection
- C. An impassioned circulation of affection
- C. An impassioned circulation of affection
- codeforces C. An impassioned circulation of affection
- An impassioned circulation of affection
- 【Codeforces 814 C. An impassioned circulation of affection】+ 尺取法
- codeforces 814C An impassioned circulation of affection
- coderforces--418 div2 C. An impassioned circulation of affection
- codeforces 814C An impassioned circulation of affection
- Codeforces#418C An impassioned circulation of affection
- codeforces 814 C An impassioned circulation of affection
- Codeforces 814C-An impassioned circulation of affection
- codeforces 814 C. An impassioned circulation of affection(暴力)
- Codeforces 814C An impassioned circulation of affection【Dp】
- codeforces 814C An impassioned circulation of affection
- Codeforces 814 C An impassioned circulation of affection
- An impassioned circulation of affection(codefoces 814c)
- C. An impassioned circulation of affection-尺取法或者DP
- NGUI Tween补间动画
- 基于密度的聚类算法与Kmeans算法的R语言脚本
- SSD 算法detection_evaluate_layer解读
- 1:java的jdk导入需要的证书就解决了,2:写个方法,在连接之前免验证证书【比较难解决】
- Spring Boot数据库基础操作
- C. An impassioned circulation of affection
- 028-Java-019
- [Leetcode] 174. Dungeon Game 解题报告
- Java中Ear、Jar、War文件之间有何不同
- 序列化 serialize 对象
- Oracle 表空间tablespace相关整理
- SFTP搭建及文件上传
- 百度社会化分享支持https
- windows下如何打开cmd窗口就能执行redis的相关命令