[Hihocoder](1441)后缀自动机一·基本概念 ---- 模拟

题目传送门

做法：
原文中对SAM概念的讲解很详细了，值得入门的时候先学习这个~
模拟即可

AC代码：

#include<bits/stdc++.h>
#define IO          ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb(x)       push_back(x)
#define sz(x)       (int)(x).size()
#define sc(x)       scanf("%d",&x)
#define abs(x)      ((x)<0 ? -(x) : x)
#define all(x)      x.begin(),x.end()
#define mk(x,y)     make_pair(x,y)
#define fin         freopen("in.txt","r",stdin)
#define fout        freopen("out.txt","w",stdout)
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int mod = 1e9+7;
const double PI = 4*atan(1.0);
const int maxm = 5e6+5;
const int maxn = 1e6+5;
const int INF = 0x3f3f3f3f;
const ll LINF = 1ll<<62;
map<string,set<int> >m;
int main()
{
    // fin;
    IO;
    string s;
    cin>>s;
    int len = s.length();
    for(int i=0;i<len;i++)
    {
        for(int j=0;j<len-i;j++)
        {
            string sub = s.substr(i,j+1);
            // cout<<sub<<" ";
            m[sub].insert(i+j+1);
        }
        // cout<<endl;
    }
    int t;
    cin>>t;
    while(t--)
    {
        int pos;
        string q,mx,mn;
        cin>>q;
        mx = q,mn = q;
        for(auto it = m.begin();it!=m.end();it++)
        {
            if(it->second == m[q])
            {  
                if(it->first.length()>mx.length())
                    mx = it->first;
                else if(it->first.length()<mn.length())
                    mn = it->first;
            }
        }
        cout<<mn<<" "<<mx;
        for(auto it = m[q].begin();it!=m[q].end();it++)
            cout<<" "<<*it;
        cout<<endl;
    }
    return 0; 
}