题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4029
题意:找出一个矩阵中有多少不相同的子矩阵
思路:考虑用hash将一个字符串变成一个数字,可以枚举宽度对每一个宽度w下的字符串进行hash,hash[i][j]即表示s[i][j]到s[i][j + w - 1]字符串的哈希值,再然后按照hash[1][0], hash[2][0]...hash[n][0],*,hash[1][1]...这样的顺序在后缀数组中连接起来,不同列间用特殊数值隔开,最后再将这些特殊符的影响用组合计数的方法消除,方法类似于HDU 4416
#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>
#include <string>
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef unsigned long long ull;
const int MAXN = 50000;
const int base = 10007;
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];
int sa[MAXN], l[MAXN], r[MAXN];
char s[200][200];
map <ull, int> mp;
ull Hash[200][200];
int main()
{
int t;
cin >> t;
for (int ca = 1; ca <= t; ca++)
{
printf("Case #%d: ", ca);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
scanf("%s", s[i]);
ll ans = 0;
memset(Hash, 0, sizeof(Hash));
for (int w = 1; w <= m; w++)
{
mp.clear();
int cnt = 1, tmp = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j + w - 1 < m; j++)
{
Hash[i][j] = Hash[i][j] * base + s[i][j + w - 1] - 'A';
if (!mp[Hash[i][j]])
mp[Hash[i][j]] = cnt++;
}
int num = 0;
for (int j = 0; j + w - 1 < m; j++)
{
for (int i = 0; i < n; i++)
r[num++] = mp[Hash[i][j]];
l[tmp++] = n;
r[num++] = cnt++;
}
r[num] = 0;
da(r, sa, Rank, height, num, cnt + 10);
ll sum = 0;
for (int i = 1; i <= num; i++)
sum += (num - sa[i] - height[i]);
ll cc = num;
for (int i = 0; i < tmp; i++)
{
cc -= l[i];
sum -= (l[i] + 1) * cc;
cc--;
}
ans += sum;
}
cout << ans << endl;
}
return 0;
}