uva11732 "strcmp()" Anyone?

strcmp() is a library function in C/C++ which compares two strings. It
takes two strings as input parameter and decides which one is
lexicographically larger or smaller: If the rst string is greater
then it returns a positive value, if the second string is greater it
returns a negative value and if two strings are equal it returns a
zero. The code that is used to compare two strings in C/C++ library is
shown below: Figure: The standard strcmp() code provided for this
problem. The number of comparisons required to compare two strings in
strcmp() function is never returned by the function. But for this
problem you will have to do just that at a larger scale. strcmp()
function continues to compare characters in the same position of the
two strings until two different characters are found or both strings
come to an end. Of course it assumes that last character of a string
is a null (\0 ') character. For example the table below shows what
happens when \than" and \that"; \therE" and \the" are compared using
strcmp() function. To understand how 7 comparisons are needed in both
cases please consult the code block given above. Input The input le
contains maximum 10 sets of inputs. The description of each set is
given below: Each set starts with an integer N (0 <N< 4001) which
denotes the total number of strings. Each of the next N lines contains
one string. Strings contain only alphanumerals ( 0 ‘…9 ', A
‘…Z ', a ‘…` z ‘) have a maximum length of 1000, and a minimum
length of 1. Input is terminated by a line containing a single zero.
Output For each set of input produce one line of output. This line
contains the serial of output followed by an integer T . This T
denotes the total number of comparisons that are required in the
strcmp() function if all the strings are compared with one another
exactly once. So for N strings the function strcmp() will be called
exactly N ( N

把字符串一个一个插入trie树中，边统计边更新，统计的时候要算上这一步成功的和上一步成功这一步失败的。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
int son[4000010],bro[4000010],l[4010],n,tot;
LL cnt[4000010];
char ch[4000010],s[4010][1010];
void init()
{
    int i;
    for (i=1;i<=n;i++)
    {
        scanf("%s",s[i]+1);
        l[i]=strlen(s[i]+1);
    }
    memset(son,0,sizeof(son));
    memset(bro,0,sizeof(bro));
    tot=0;
}
LL solve()
{
    int i,j,k,p,tem;
    bool flag;
    LL ans=0,last;
    for (i=1;i<=n;i++)
    {
        p=0;
        last=i-1;
        for (j=1;j<=l[i]+1;j++)
        {
            flag=0;
            for (k=son[p];k;tem=k,k=bro[k])
              if (ch[k]==s[i][j])
              {
                flag=1;
                break;
              }
            if (flag) p=k;
            else
            {
                if (!son[p]) son[p]=++tot;
                else bro[tem]=++tot;
                p=tot;
                ch[p]=s[i][j];
                cnt[p]=0;
            }
            ans+=cnt[p]+last;
            last=cnt[p];
            cnt[p]++;
        }
    }
    return ans;
}
int main()
{
    int K=0;
    while (scanf("%d",&n)&&n)
    {
        init();
        printf("Case %d: %lld\n",++K,solve());
    }
}