(http://acm.hust.edu.cn/vjudge/contest/view.action?cid=106071#problem/C)
题意:问s,分别输出1~len的子串最多出现次数。
解法:构造后缀自动机,然后拿step和right搞一搞就好了。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <queue>
#include <tr1/unordered_set>
//#include <tr1/unordered_map>
#include <bitset>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define inf 1e9
#define debug(a) cout << #a" = " << (a) << endl;
#define debugarry(a, n) for (int i = 0; i < (n); i++) { cout << #a"[" << i << "] = " << (a)[i] << endl; }
#define clr(x, y) memset(x, y, sizeof x)
#define ll long long
#define ull unsigned long long
#define FOR(i,a,b) \
for(i=a;a<b?i<=b:i>=b;a<b?i++:i--)
const int maxn=2*90000+30;
struct suffix_automaton{
int son[maxn][30],pre[maxn],step[maxn];
int last,si;
int nextson[maxn][30],fison[maxn];
void pushback(int v)
{
step[++si]=v;
pre[si]=-1;
clr(son[si],-1);
}
void Extend(int ch)
{
pushback(step[last]+1);
int p=last,np=si;
while(p!=-1&&son[p][ch]==-1)
son[p][ch] = np , p = pre[p];
if(p==-1) pre[np]=0;
else{
int q = son[p][ch];
if(step[q]==step[p]+1) pre[np]=q;
else{
pushback(step[p]+1);
int nq=si;
memcpy(son[nq],son[q],sizeof son[q]);
pre[nq]=pre[q];
pre[q]=pre[np]=nq;
while(p!=-1&&son[p][ch]==q)
son[p][ch]=nq,p=pre[p];
}
}
last=np;
}
void init()
{
si=last=0;
clr(son[0],-1);
pre[0]=-1;
step[0]=0;
}
int sum[maxn];
int cnt[maxn],pos[maxn];
void cca()
{
clr(cnt,0);
for(int i=0;i<=si;i++)
cnt[step[i]]++;
for(int i=1;i<=si;i++)
cnt[i]+=cnt[i-1];
for(int i=0;i<=si;i++)
pos[--cnt[step[i]]]=i;
for(int q=si;q>=0;q--)
{
int i=pos[q];
sum[i]=1;
for(int j=0;j<26;j++) if(son[i][j]!=-1)
sum[i] += sum[son[i][j]];
}
}
void Find(int k)
{
k++;
int p=0;
while(1)
{
if(--k==0) break;
for(int i=0;;i=(i+1)%26) if(son[p][i]!=-1)
{
if( sum[son[p][i]] < k ) k-=sum[son[p][i]];
else
{
p=son[p][i];
printf("%c",i+'a');
break;
}
}
}
printf("\n");
}
}su;
char s[maxn];
int k;
int main()
{
// freopen("input.txt","r",stdin);
//freopen("out2.txt","w",stdout);
scanf("%s",s);
su.init();
for(int i=0;s[i];i++)
su.Extend(s[i]-'a');
su.cca();
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&k);
su.Find(k);
}
return 0;
}