HDU 5769 Substring (后缀数组)

题意：给出一个字符和一个字符串，求包含此字符的不同的子字符串。

题解：后缀数组
子串本质：后缀的前缀
不同子串数=$\Sigma (n-sa[i]-height[i])$，即去除相同前缀。
因为要包含此字符，所以还要去除不包含此字符的子串，从后往前，用$pre$数组来保存离当前字符最近的此字符的位置，取$pre[i]$和$sa[i]+height[i]$两者最大的即可。

tips：
杭电的题，用C++会t，改G++。
答案为long long。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#define ll long long
using namespace std;
//DC3
const int MAXN = 1e5 + 10;
#define F(x) ((x)/3+((x)%3==1?0:tb))
#define G(x) ((x)<tb?(x)*3+1:((x)-tb)*3+2)
int wa[MAXN * 3], wb[MAXN * 3], wv[MAXN * 3], wss[MAXN * 3];
int c0(int* r, int a, int b) {
    return r[a] == r[b] && r[a + 1] == r[b + 1] && r[a + 2] == r[b + 2];
}
int c12(int k, int* r, int a, int b) {
    if (k == 2)
        return r[a] < r[b] || (r[a] == r[b] && c12(1, r, a + 1, b + 1));
    else return r[a] < r[b] || (r[a] == r[b] && wv[a + 1] < wv[b + 1]
        );
}
void sort(int* r, int* a, int* b, int n, int m) {
    int i;
    for (i = 0; i < n; i++)wv[i] = r[a[i]];
    for (i = 0; i < m; i++)wss[i] = 0;
    for (i = 0; i < n; i++)wss[wv[i]]++;
    for (i = 1; i < m; i++)wss[i] += wss[i - 1];
    for (i = n - 1; i >= 0; i--)
        b[--wss[wv[i]]] = a[i];
}
void dc3(int* r, int* sa, int n, int m) {
    int i, j, * rn = r + n;
    int* san = sa + n, ta = 0, tb = (n + 1) / 3, tbc = 0, p;
    r[n] = r[n + 1] = 0;
    for (i = 0; i < n; i++)if (i % 3 != 0)wa[tbc++] = i;
    sort(r + 2, wa, wb, tbc, m);
    sort(r + 1, wb, wa, tbc, m);
    sort(r, wa, wb, tbc, m);
    for (p = 1, rn[F(wb[0])] = 0, i = 1; i < tbc; i++)
        rn[F(wb[i])] = c0(r, wb[i - 1], wb[i]) ? p - 1 : p++;
    if (p < tbc)dc3(rn, san, tbc, p);
    else for (i = 0; i < tbc; i++)san[rn[i]] = i;
    for (i = 0; i < tbc; i++) if (san[i] < tb)wb[ta++] = san[i] * 3;
    if (n % 3 == 1)wb[ta++] = n - 1;
    sort(r, wb, wa, ta, m);
    for (i = 0; i < tbc; i++)wv[wb[i] = G(san[i])] = i;
    for (i = 0, j = 0, p = 0; i < ta && j < tbc; p++)
        sa[p] = c12(wb[j] % 3, r, wa[i], wb[j]) ? wa[i++] : wb[j++];
    for (; i < ta; p++)sa[p] = wa[i++];
    for (; j < tbc; p++)sa[p] = wb[j++];
}
//str 和 sa 也要三倍
void da(int str[], int sa[], int rank[], int height[], int n, int m) {
    for (int i = n; i < n * 3; i++)
        str[i] = 0;
    dc3(str, sa, n + 1, m);
    int i, j, k = 0;
    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], sa[MAXN];
int r[MAXN], t, nxt[MAXN];
char s[MAXN], key[1];
int main() {
    scanf("%d", &t);
    int cas = 0;
    while (t--) {
        scanf("%s%s", key, s);
        int len = strlen(s), pre = -1;
        for (int i = len - 1; i >= 0; i--) {
            if (s[i] == key[0]) pre = i;
            nxt[i] = pre;
        }
        for (int i = 0; i < len; i++) {
            r[i] = s[i];
        }
        r[len] = 0;
        ll ans = 0;
        da(r, sa, Rank, height, len, 128);
        for (int i = 1; i <= len; i++) {
            if(nxt[sa[i]] != -1) ans += len - max(nxt[sa[i]], sa[i] + height[i]);
        }
        printf("Case #%d: %lld\n", ++cas, ans);
    }
}