[Link] https://www.acmicpc.net/problem/16229
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <stack>
// #include <bits/stdc++.h>
using namespace std;
#define for0(i, n) for(int i = 0; i < n; i++)
#define for1(i, n) for(int i = 1; i < n; i++)
#define fori(s, e) for(int i = s; i < e; i++)
#define ll long long
#define endl "\n"
#define nulls '\0'
#define dkdk " "
const int MAX = 5e5 + 1;
const int INF = 987654321;
string s;
vector<int> z;
void __z() {
z.resize(s.size());
int l = s.size(), r = s.size() - 1;
z[s.size() - 1] = s.size();
for(int i = s.size() - 2; i >= 0; i--) {
z[i] = (l <= i) ? min(z[i-r+s.size()-1], i-l+1) : 0;
// cout << " z : " << z[i] << " " << l << " " << i << endl;
while(i - z[i] >= 0 && s[i-z[i]] == s[s.size() - 1 - z[i]]) z[i]++;
if(i - z[i] + 1 < l) {
l = i - z[i] + 1;
r = i;
}
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> s;
int m; cin >> m;
__z();
for0(i, m) {
int in; cin >> in;
cout << z[in - 1] << endl;
}
return 0;
}