Suffix Automata Mapping
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<string>
#include<iomanip>
#include<map>
#include<cmath>
using namespace std;
const int maxn = 5e5 + 10;
typedef long long ll;
void acc_ios()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
struct node
{
int ch[26];
int len, fa;
node()
{
memset(ch, 0, sizeof(0));
len = 0;
}
}dian[maxn<<1];
string s;
int las = 1, tot = 1;
void add(int c)
{
int p = las, np = las = ++tot;
dian[np].len = dian[p].len + 1;
for(; p && !dian[p].ch[c]; p = dian[p].fa) dian[p].ch[c] = np;
if(!p) dian[np].fa = 1;
else
{
int q = dian[p].ch[c];
if(dian[q].len == dian[p].len + 1) dian[np].fa = q;
else
{
int nq = ++tot;
dian[nq] = dian[q];
dian[nq].len = dian[p].len + 1;
dian[q].fa = dian[np].fa = nq;
for(; p && dian[p].ch[c] == q; p = dian[p].fa) dian[p].ch[c] = nq;
}
}
}