【题解】⭐⭐⭐codeforce1187 B. Letters Shop【二分+前缀和】

codeforce1187 B. Letters Shop

The letters shop showcase is a string s, consisting of n lowercase Latin letters. As the name tells, letters are sold in the shop.

Letters are sold one by one from the leftmost to the rightmost. Any customer can only buy some prefix of letters from the string s.

There are m friends, the i-th of them is named ti. Each of them is planning to estimate the following value: how many letters (the length of the shortest prefix) would s/he need to buy if s/he wanted to construct her/his name of bought letters. The name can be constructed if each letter is presented in the equal or greater amount.

For example, for s=“arrayhead” and ti=“arya” 5 letters have to be bought (“arrayhead”).
For example, for s=“arrayhead” and ti=“harry” 6 letters have to be bought (“arrayhead”).
For example, for s=“arrayhead” and ti=“ray” 5 letters have to be bought (“arrayhead”).
For example, for s=“arrayhead” and ti=“r” 2 letters have to be bought (“arrayhead”).
For example, for s=“arrayhead” and ti=“areahydra” all 9 letters have to be bought (“arrayhead”).
It is guaranteed that every friend can construct her/his name using the letters from the string s.

Note that the values for friends are independent, friends are only estimating them but not actually buying the letters.

Input

The first line contains one integer n (1≤n≤2⋅105) — the length of showcase string s.

The second line contains string s, consisting of exactly n lowercase Latin letters.

The third line contains one integer m (1≤m≤5⋅104) — the number of friends.

The i-th of the next m lines contains ti (1≤|ti|≤2⋅105) — the name of the i-th friend.

It is guaranteed that ∑i=1m|ti|≤2⋅105.

Output

For each friend print the length of the shortest prefix of letters from s s/he would need to buy to be able to construct her/his name of them. The name can be constructed if each letter is presented in the equal or greater amount.

It is guaranteed that every friend can construct her/his name using the letters from the string s.

Examples

inputCopy
9
arrayhead
5
arya
harry
ray
r
areahydra
outputCopy
5
6
5
2
9

Hint

题意:

给出一个字符串s, 可以从左往右拿走s的字符, 至少要到s的第几个位置才能拼成t

题解:

前缀和存一下26个字母的出现次数, 然后二分查找最小值即可

经验小结:

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define ms(x, n) memset(x,n,sizeof(x));
typedef  long long LL;
const int inf = 1<<30;
const LL maxn = 2e5+10;
 
int cnt[maxn][26], tcnt[26], n, q;
string s, t;
bool judge(int l){
    for(int i = 0; i < 26; ++i)
        if(tcnt[i] - cnt[l][i] > 0)
            return false;
    return true;
}
int main()
{
    cin >> n >> s >> q;
    for(int i = 0; i < s.length(); ++i){
        ++cnt[i][s[i]-'a'];
        if(i != 0)
            for(int j = 0; j < 26; ++j)
                cnt[i][j] += cnt[i-1][j];
    }
    int ans = 0;
    while(q--){
        cin >> t;
        ms(tcnt, 0);
        for(int i = 0; i < t.length(); ++i)
            ++tcnt[t[i]-'a'];
 
        int l = 0, r = s.length(), mid;
        while(l < r){
            int mid = (l+r)/2;
            if(judge(mid))
                r = mid;
            else
                l = mid+1;
        }
        cout << l+1 << endl;
    }
 
	return 0;
}