【后缀数组】 POJ 3415 Common Substrings

看那篇后缀数组的神论文吧。。。我也不是很懂。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 300005
#define maxm 300005
#define eps 1e-10
#define mod 1000000007
#define INF 1e17
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

char s[maxn];
int sa[maxn], t1[maxn], t2[maxn], c[maxn];
int rank[maxn], height[maxn];
stack<pair<int, int> > ss;
int k, t;

void build(int n, int m)
{
	int *x = t1, *y = t2;
	for(int i = 0; i < m; i++) c[i] = 0;
	for(int i = 0; i < n; i++) c[x[i] = s[i]]++;
	for(int i = 1; i < m; i++) c[i] += c[i-1];
	for(int i = n-1; i >= 0; i--) sa[--c[x[i]]] = i;
	for(int k = 1, p = 0; k <= n; k <<= 1, p = 0) {
		for(int i = n-k; i < n; i++) y[p++] = i;
		for(int i = 0; i < n; i++) if(sa[i] >= k) y[p++] = sa[i] - k;
		for(int i = 0; i < m; i++) c[i] = 0;
		for(int i = 0; i < n; i++) c[x[y[i]]]++;
		for(int i = 1; i < m; i++) c[i] += c[i-1];
		for(int i = n-1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
		p = 1, swap(x, y), x[sa[0]] = 0;
		for(int i = 1; i < n; i++)
			x[sa[i]] = y[sa[i]] == y[sa[i-1]] && y[sa[i]+k] == y[sa[i-1]+k] ? p-1 : p++;
		if(p >= n) break;
		m = p;
	}
}

void getheight(int n)
{
	int k = 0;
	for(int i = 0; i <= n; i++) rank[sa[i]] = i;
	for(int i = 0; i < n; i++) {
		if(k) k--;
		int j = sa[rank[i] - 1];
		while(s[i+k] == s[j+k]) k++;
		height[rank[i]] = k;
	}
}

void read(void)
{
	scanf("%s", s);
	t = strlen(s);
	s[t] = 127;
	scanf("%s", s + t + 1);
}

void work(void)
{
	int n = strlen(s);
	build(n+1, 128);
	getheight(n);
	LL ans = 0, sum = 0;
	while(!ss.empty()) ss.pop();
	for(int i = 1; i <= n; i++) {
		int cnt = 0;
		while(!ss.empty() && ss.top().first >= height[i]) {
			pair<int, int> p = ss.top(); ss.pop();
			cnt += p.second;
			sum -= p.second * (p.first - k + 1LL);
		}
		if(height[i] >= k) {
			cnt += (sa[i-1] > t);
			if(cnt) ss.push(mp(height[i], cnt));
			sum += cnt * (height[i] - k + 1LL);
		}
		if(sa[i] < t) ans += sum;
	}
	
	sum = 0;
	while(!ss.empty()) ss.pop();
	for(int i = 1; i <= n; i++) {
		int cnt = 0;
		while(!ss.empty() && ss.top().first >= height[i]) {
			pair<int, int> p = ss.top(); ss.pop();
			cnt += p.second;
			sum -= p.second * (p.first - k + 1LL);
		}
		if(height[i] >= k) {
			cnt += (sa[i-1] < t);
			if(cnt) ss.push(mp(height[i], cnt));
			sum += cnt * (height[i] - k + 1LL);
		}
		if(sa[i] > t) ans += sum;
	}
	printf("%I64d\n", ans);
}

int main(void)
{
	while(scanf("%d", &k), k != 0) {
		read();
		work();
	}
	return 0;
}