codeforces C. An impassioned circulation of affection

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

题意：

给出一串字符，现在给你一次机会让你替换里面的字母，问最多能替换成最长的相同字母
比如样例一：
6
koyomi
3
1 o
4 o
4 m
一共6个字母第一次你有1次机会替换其中的一个字母为o，所以把y替换之后最长o串为3个，输出三即可，第二次有4次机会替换其中的字符为o那么就直接全部替换输出6即可。第三次雷同。
思路：
要我自己想题是绝对想不到是dp题的。。。但是这道题确实是dp，又领教了dp
的无所不能。dp[i][j]表示字母i替换j次的最长个数，那么就递推！怎么递推？直接
从小到大依次的替换就行了。
但是有两个最重要的问题一定要注意。

• 递推的时候需要依次从长度1到n进行替换，每次替换需要减去其长度范围内出现目标字母的个数
• 递推完之后千万别想着就是最优解，因为有可能出现初始字母全部相同的情况

#include <iostream>
#include <cstdio>

using namespace std;

const int maxn = 2005;

int n,m;
char s[maxn];
int dp[30][maxn];

int main()
{
    //freopen("in.txt","r",stdin);

    scanf("%d",&n);
    scanf("%s",s);
    for(int i = 0;i <= 'z'-'a'; i++) {
        for(int j = 1;j <= n; j++) {
            int cnt = 0;
            for(int k = 0;k < j; k++) {
                if(s[k] - 'a' == i)
                    cnt++;
            }
            for(int k = 0;k <= n-j; k++) {
                dp[i][j-cnt] = max(dp[i][cnt],j);
                if(s[k] - 'a' == i)
                    cnt--;
                if(k+j < n && s[k+j] - 'a' == i)
                    cnt++;
            }
        }
    }

    for(int i=0;i<26;i++)
    {
        for(int j=1;j<=n;j++)
        {
            dp[i][j]=max(dp[i][j],dp[i][j-1]);
        }
    }

    scanf("%d",&m);
    char temp[2];
    int temp1;
    for(int i = 1;i <= m; i++) {
        scanf("%d%s",&temp1,temp);
        printf("%d\n",dp[temp[0]-'a'][temp1]);
    }

    return 0;
}