【Codeforces 814 C. An impassioned circulation of affection】+ 尺取法

C. An impassioned circulation of affection

time limit per test2 seconds

memory limit per test256 megabytes

inputstandard input

outputstandard output

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.

Input

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

Output q lines: for each work plan, output one line containing an integer — the largest Koyomity achievable after repainting the garland according to it.

Examples

Input

6

koyomi

3

1 o

4 o

4 m

Output

3

6

5

Input

15

yamatonadeshiko

10

1 a

2 a

3 a

4 a

5 a

1 b

2 b

3 b

4 b

5 b

Output

3

4

5

7

8

1

2

3

4

5

Input

10

aaaaaaaaaa

2

10 b

10 z

Output

10

10

Note

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 3 is 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.

Codeforces Round #418 (Div. 2)

Finished

Practice

→ Virtual participation

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests. If you’ve seen these problems, a virtual contest is not for you - solve these problems in the archive. If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive. Never use someone else’s code, read the tutorials or communicate with other person during a virtual contest.

→ Submit?

Language:

Choose file:

Be careful: there is 50 points penalty for submission which fails the pretests or resubmission (except failure on the first test, denial of judgement or similar verdicts). “Passed pretests” submission verdict doesn’t guarantee that the solution is absolutely correct and it will pass system tests.

→ Last submissions

Submission

Time

Verdict

27640968

Jun/07/2017 16:01

Accepted

→ Problem tags

two pointers

No tag edit access

1) 预处理每个位置前，每个字符的个数

2)预处理把 i 到 j 变成 o,字符的代价

3)更新每种字符的每种代价的最优解

AC代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX = 1510;
typedef long long LL;
char s[MAX];
int num[MAX][26],sum[26],cut[26][MAX];
int main()
{
int n;
scanf("%d",&n);
scanf("%s",s);
for(int i = 0; i < n; i++){
int o = s[i] - 'a';
sum[o]++;
num[i][o] = sum[o];
}
for(int i = 0; i < 26; i++)
for(int j = 1; j < n; j++)
num[j][i] = max(num[j][i],num[j - 1][i]);
for(int o = 0; o < 26; o++)
for(int i = 0; i < n; i++)
for(int j = i; j < n; j++){
int p = j - i + 1;
int q = num[j][o] - num[i][o];
if(s[i] - 'a' == o) q++;
int w = p - q;
cut[o][w] = max(cut[o][w],p);
}
for(int i = 0; i < 26; i++)
for(int j = 1; j <= n; j++)
cut[i][j] = max(cut[i][j],cut[i][j - 1]);
int m;
scanf("%d",&m);
while(m--){
int a;
char c[2];
scanf("%d%s",&a,c);
int o = c[0] - 'a';
printf("%d\n",cut[o][a]);
}
return 0;
}