Codeforces-An impassioned circulation of affection （尺取法）

C. An impassioned circulation of affection

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard 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

题解：

尺取法，直接暴力模拟就可以过。也可以与处理一下，将26*1500种变化的结果预处理出来，这样比较快。

暴力：1185ms

#include<iostream>
#include<cstring>
#include<math.h>
#include<stdlib.h>
#include<cstring>
#include<cstdio>
#include<utility>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
using namespace std;
typedef long long ll;
const int Max = 1e4+5;
const int mod = 1e9+7;
const int Hash = 10000;
const int INF = 1<<30;
const ll llINF = 1e18;

int n,k;
char arr[Max];
int solve(int k, char c)
{
    int a=0,b=0;//双指针模拟
    int cnt = 0, ans = -1;
    while( b<n )
    {
        while((cnt<k || arr[b]==c) && b<n)
        {
            if(arr[b] != c)
                cnt++;//已经替换的次数
            b++;
        }
        ans = max(ans, b-a);//更新最大值
        if(arr[a++] != c)
            cnt--;
    }
    return ans;
}
int main( )
{
    //freopen("input.txt", "r", stdin);
    while(~scanf("%d",&n))
    {
        scanf("%s", arr);
        int m;
        scanf("%d", &m);
        while(m--)
        {
            int k;
            char c;
            scanf("%d %c", &k,&c);
            int ans = solve(k, c);
            printf("%d\n", ans);
        }
    }
    return 0;
}

预处理： 265ms

#include<iostream>
#include<cstring>
#include<math.h>
#include<stdlib.h>
#include<cstring>
#include<cstdio>
#include<utility>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
using namespace std;
typedef long long ll;
const int Max = 1e4+5;
const int mod = 1e9+7;
const int Hash = 10000;
const int INF = 1<<30;
const ll llINF = 1e18;

int n,k;
char arr[Max];
int ans[26][1505];
int solve(char  c, int k)
{
    int a=0,b=0;//双指针模拟
    int cnt = 0, ans = -1;
    while( b<n )
    {
        while((cnt<k || arr[b]==c) && b<n)
        {
            if(arr[b] != c)
                cnt++;//已经替换的次数
            b++;
        }
        ans = max(ans, b-a);//更新最大值
        if(arr[a++] != c)
            cnt--;
    }
    return ans;
}
void init( )
{
    for(int i=0; i<26; i++)
        for(int j=1; j<=1500; j++)
            ans[i][j] = solve(i+'a', j);
}
int main( )
{
    //freopen("input.txt", "r", stdin);
    while(~scanf("%d",&n))
    {
        scanf("%s", arr);
        init( );//预处理O(26*1500)
        int m;
        scanf("%d", &m);
        while(m--)
        {
            int k;
            char c;
            scanf("%d %c", &k,&c);
            printf("%d\n", ans[c-'a'][k]);
        }
    }
    return 0;
}

顺便学习一下尺取法。。。