814C.md (3206B)
1 Source: https://codeforces.com/problemset/problem/814/C 2 3 C. An impassioned circulation of affection 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 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! 22 23 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 *s**i*, 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. 24 25 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. 26 27 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 *m**i* and a lowercase letter *c**i*, meanings of which are explained above. You are to find out the maximum Koyomity achievable after repainting the garland according to each plan. 28 29 Input 30 31 The first line of input contains a positive integer *n* (1 ≤ *n* ≤ 1 500) — the length of the garland. 32 33 The second line contains *n* lowercase English letters *s*1*s*2... *s**n* as a string — the initial colours of paper pieces on the garland. 34 35 The third line contains a positive integer *q* (1 ≤ *q* ≤ 200 000) — the number of plans Nadeko has. 36 37 The next *q* lines describe one plan each: the *i*-th among them contains an integer *m**i* (1 ≤ *m**i* ≤ *n*) — the maximum amount of pieces to repaint, followed by a space, then by a lowercase English letter *c**i* — Koyomi's possible favourite colour. 38 39 Output 40 41 Output *q* lines: for each work plan, output one line containing an integer — the largest Koyomity achievable after repainting the garland according to it. 42 43 Examples 44 45 Input 46 47 ``` 48 6 49 koyomi 50 3 51 1 o 52 4 o 53 4 m 54 ``` 55 56 Output 57 58 ``` 59 3 60 6 61 5 62 ``` 63 64 Input 65 66 ``` 67 15 68 yamatonadeshiko 69 10 70 1 a 71 2 a 72 3 a 73 4 a 74 5 a 75 1 b 76 2 b 77 3 b 78 4 b 79 5 b 80 ``` 81 82 Output 83 84 ``` 85 3 86 4 87 5 88 7 89 8 90 1 91 2 92 3 93 4 94 5 95 ``` 96 97 Input 98 99 ``` 100 10 101 aaaaaaaaaa 102 2 103 10 b 104 10 z 105 ``` 106 107 Output 108 109 ``` 110 10 111 10 112 ``` 113 114 Note 115 116 In the first sample, there are three plans: 117 118 * 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; 119 * In the second plan, at most 4 pieces can be repainted, and "oooooo" results in a Koyomity of 6; 120 * In the third plan, at most 4 pieces can be repainted, and "mmmmmi" and "kmmmmm" both result in a Koyomity of 5.