codeforces 814C 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

分析：当时想对于每次询问做操作得到答案的话 复杂度为：1500*200000 =3秒 恐怖，不敢直接对怂，然后想先全部预处理 复杂度为： 26*1500*1500 不到2秒。可以过可惜没有写出来。可是发现队友直接对怂就过了，数据不行啊。真的是烦。过后发现最多为 26*1500个状态的询问，记忆一下对怂就OK啦，气死人，虽然直接对怂也可过但是出题人给我们玩的游戏很不错嘛。

代码：此代码不记录答案会超时。用尺取法直接对怂可过。

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define siz 10555
const int maxs = 55;
using namespace std;
int n,m;
char str[siz];
int Z[siz];
int ans[maxs][siz];
int solve(char s,int k)
{
    int cot = 0,ans=0;
    for(int i=0; i<n; i++)
    {
        if(str[i] ==s) cot++;
        Z[i+1] = i+1 - cot;
    }
    for(int i=1; i<=n; i++)
    {
        int key = Z[i] - k;
        int id = lower_bound(Z,Z+i+1,key) - Z;
        ans = max(ans,i - id);
    }
    return ans;
}
int main()
{
    int val;
    char s;
    memset(ans,-1,sizeof(ans));
    scanf("%d",&n);
    scanf("%s",str);
    scanf("%d",&m);
    for(int i=1; i<=m; i++)
    {
        scanf("%d %c",&val,&s);
        if(ans[s-'a'][val]==-1)
        {
            ans[s-'a'][val] = solve(s,val);
        }
        printf("%d\n",ans[s-'a'][val]);
    }
    return 0;
}