HDU 4416 Good Article Good sentence（后缀数组）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4416

 

题意：给出一个A串，若干个B串，问A中有多少子串未在任一B串中出现过

 

思路：先将A串和所有B串连起来，中间用特殊字符隔开，求出总串有多少不相同子串，再将A串拿掉，求出所有B串的不相同子串，两者相减即为答案

在求的过程中，难点在于如何减去那些由特殊字符组成的子串，我们可以枚举每个特殊字符i，包含该字符的不相同子串个数可以通过分别计算该字符左右字符数算出来，分别减去即可

 

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;

const int MAXN = 350000;

typedef long long ll;

int t1[MAXN], t2[MAXN], c[MAXN];

bool cmp(int *r, int a, int b, int l)
{
	return r[a] == r[b] && r[a + l] == r[b + l];
}

void da(int str[], int sa[], int Rank[], int height[], int n, int m)
{
	n++;
	int i, j, p, *x = t1, *y = t2;
	for (i = 0; i < m; i++)c[i] = 0;
	for (i = 0; i < n; i++)c[x[i] = str[i]]++;
	for (i = 1; i < m; i++)c[i] += c[i - 1];
	for (i = n - 1; i >= 0; i--)sa[--c[x[i]]] = i;
	for (j = 1; j <= n; j <<= 1)
	{
		p = 0;
		for (i = n - j; i < n; i++)y[p++] = i;
		for (i = 0; i < n; i++)if (sa[i] >= j)y[p++] = sa[i] - j;
		for (i = 0; i < m; i++)c[i] = 0;
		for (i = 0; i < n; i++)c[x[y[i]]]++;
		for (i = 1; i < m; i++)c[i] += c[i - 1];
		for (i = n - 1; i >= 0; i--)sa[--c[x[y[i]]]] = y[i];
		swap(x, y);
		p = 1; x[sa[0]] = 0;
		for (i = 1; i < n; i++)
			x[sa[i]] = cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++;
		if (p >= n)break;
		m = p;
	}
	int k = 0;
	n--;
	for (i = 0; i <= n; i++)Rank[sa[i]] = i;
	for (i = 0; i < n; i++)
	{
		if (k)k--;
		j = sa[Rank[i] - 1];
		while (str[i + k] == str[j + k])k++;
		height[Rank[i]] = k;
	}
}

int Rank[MAXN], height[MAXN];

char str[MAXN];
int l[MAXN], r[MAXN], rr[MAXN];
int sa[MAXN];

int main()
{
	int t;
	cin >> t;
	for (int ca = 1; ca <= t; ca++)
	{
		printf("Case %d: ", ca);
		int n;
		scanf("%d", &n);
		scanf("%s", str);

		int len = 0, lenb = 0;
		for (int i = 0; str[i]; i++)
			r[len++] = str[i] - 'a' + 1;
		l[0] = len;

		for (int i = 1; i <= n; i++)
		{
			lenb = 0;
			r[len++] = i + 26;
			scanf("%s", str);
			for (int j = 0; str[j]; j++)
			{
				r[len++] = str[j] - 'a' + 1;
				lenb++;
			}
			l[i] = lenb;
		}
		r[len] = 0;

		da(r, sa, Rank, height, len, 100050);

		long long sum = 0;
		for (int i = 1; i <= len; i++)
			sum += len - sa[i] - height[i];

		long long tmp = len;
		for (int i = 0; i < n; i++)
		{
			tmp -= l[i];
			sum -= (l[i] + 1) * tmp;
			tmp--;
		}

		lenb = 0;
		for (int i = l[0] + 1; i <= len; i++)
			rr[lenb++] = r[i];
		lenb--;

		da(rr, sa, Rank, height, lenb, 100050);
		long long sumb = 0;
		for (int i = 1; i <= lenb; i++)
			sumb += lenb - sa[i] - height[i];

		tmp = lenb;
		for (int i = 1; i < n; i++)
		{
			tmp -= l[i];
			sumb -= (l[i] + 1) * tmp;
			tmp--;
		}
		
		cout << sum - sumb << endl;
	}
	return 0;
}