字典树（Trie树）模版

#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int maxn=const int maxnode=const int sigma_size=struct Trie{    int ch[maxnode][sigma_size];    int val[maxnode];    int sz;    Trie(){sz=1;memset(ch[0],0,sizeof(ch[0]));}    int idx(char c) {return c-'a';}    void insert(char *s,int v)    {        int u=0,n=strlen(s);        for(int i=0;i<n;i++)        {            int c=idx(s[i]);            if(!ch[u][c])            {                memset(ch[sz],0,sizeof(ch[sz]));                val[sz]=0;                ch[u][c]=sz++;            }            u=ch[u][c];        }        val[u]=v;    }}P;