hdu 4416 Good Article Good sentence

后悔为啥当时神马后缀数组后缀树都不会，最擅长的费用流也没想出来，搞的杭州赛区挂掉了。。。T T

#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)        for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define MC(a,b)		memcpy(a,b,sizeof(b))
#define MAX(a,b)        ((a)>(b)?(a):(b))
#define MIN(a,b)        ((a)<(b)?(a):(b))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);

const int maxn = 200011;
const int maxc = 26;

int go[maxn][maxc];
int f[maxn];
int len[maxn];
int dp[maxn];
bool vis[maxn];

struct suffix_automaton
{
	const static int head = 1;
	int use;
	int last;

	int get()
	{
		use++;
		MM(go[use],0);
		return use;
	}

	void init()
	{
		use=-1;
		last = 1;
		get();get();
		f[0]=f[1]=len[0]=len[1]=0;
		return ;
	}

	void extend(int c)
	{
		int end = get();
		int now = last;
		len[end] = len[last]+1;
		last = end;
		for(;now && !go[now][c];now=f[now]) go[now][c]=end;
		if(!now) f[end] = head;
		else
		{
			int to = go[now][c];
			if(len[now]+1==len[to]) f[end] = to;
			else
			{
				int np = get();
				MC(go[np], go[to]);
				len[np] = len[now]+1;
				f[np] = f[to];
				f[to] = f[end] = np;
				for(;now && go[now][c]==to;now=f[now]) go[now][c] = np;
			}
		}
	}

	void gao(int now)
	{
		if(vis[now] || !now)
		{
			return ;
		}
		else
		{
			dp[now]=len[now];
			vis[now] = true;
			gao(f[now]);
		}
	}

	void ak(string & s)
	{
		int sp = 0;
		int now = 1;
		int to,temp;
		int c;
		for(int i=0;i<s.length();i++)
		{
			c = s[i]-'a';
			to = go[now][c];
			if(to)
			{
				sp++;
				sp = min(sp,len[to]);
				dp[to]=max(dp[to],sp);
				now = to;
				gao(f[now]);
			}
			else
			{
				temp = now;
				for(;temp && !go[temp][c];temp=f[temp]);
				if(!temp)
				{
					now = head;
					sp = 0;
				}
				else
				{
					sp = min(sp,len[temp]);
					sp++;
					temp = go[temp][c];
					dp[temp]=max(min(sp,len[temp]),dp[temp]);
					now = temp;
					gao(f[now]);
				}
			}
		}
	}
}SA;


int main()
{
	string s;
	char ch[maxn];
	int T;
	cin>>T;
	int n;
	for(int tt=1;tt<=T;tt++)
	{
		cin>>n;
		scanf("%s",ch);
		s = ch;
		SA.init();
		for(int i=0;i<s.length();i++)
		{
			SA.extend(s[i]-'a');
		}
		for(int i=0;i<=SA.use;i++)
		{
			dp[i] = len[f[i]];
			vis[i] = false;
		}
		for(int i=1;i<=n;i++)
		{
			scanf("%s",ch);
			s=ch;
			SA.ak(s);
		}
		i64 ans = 0;
		for(int i=1;i<=SA.use;i++)
		{
			ans += len[i]-dp[i];
		}
		printf("Case %d: %I64d\n",tt,ans);
	}
    return 0;
}