[codeforces] 633C Spy Syndrome 2

#include<cstdio>
#include<cstring>
#include<vector>
#define M 1001000
#define N 10010
using namespace std;
int n,m,dp[M],l[M],cnt=2,now,ll,pos[M];
char s[M],t[M];
vector <int> v;
struct hhh
{
    int son[26],is;
    hhh()
    {
        is=0;
        memset(son,0,sizeof(son));
    }
}edge[M];

void add(int x)
{
    now=1;
    int q;
    for (int i=ll+1;i<=ll+l[x];i++)
    {
    if (t[i]<‘a‘) q=‘a‘-‘A‘;else q=0;
    if (edge[now].son[t[i]-‘a‘+q]) now=edge[now].son[t[i]-‘a‘+q];
    else
    {
        edge[now].son[t[i]-‘a‘+q]=cnt++;
        now=edge[now].son[t[i]-‘a‘+q];
    }
    }
    edge[now].is=x;
}

int main()
{
    scanf("%d",&n);
    scanf("%s",s+1);
    scanf("%d",&m);
    for (int i=1;i<=m;i++)
    {
    scanf("%s",t+ll+1);
    pos[i]=ll+1;
    l[i]=strlen(t+ll+1);
    add(i);
    ll+=l[i];
    }
    dp[0]=1;
    for (int i=1;i<=n;i++)
    {
    now=1;
    for (int j=1;j<=i && now;j++)
    {
        now=edge[now].son[s[i-j+1]-‘a‘];
        if (edge[now].is && dp[i-j])
        {
        dp[i]=edge[now].is;
        break;
        }
    }
    }
    for (int i=n;i>=1;i-=l[dp[i]])
    v.push_back(dp[i]);
    int ss=v.size();
    for (int i=ss-1;i>=0;i--)
    {
    for (int j=1;j<=l[v[i]];j++)
        putchar(t[pos[v[i]]+j-1]);
    putchar(‘ ‘);
    }
    return 0;
}