URAL 1713 Key Substrings 后缀数组
这一类题目，首先模板抄对，熟悉通常问题的解法，把论文里的题目弄懂，一般的题目就可解了
多字符串题目，都是连成一个串再处理
最好写个debuge_sa()检验模板：
比如：
void debuge_sa()
{
for (int i = 0; i <= n; i++)
cout << i << ' ' << rank[i] << ' ' << height[i] << endl;
cout << "^^^^^^^^^^^^^^" << endl << endl;
for (int i = 0; i <= n; i++)
cout << i << ' ' << sa[i] << endl;
cout << "^^^^^^^^^^^^^^" << endl << endl;
init_rmq(n);
for (int i = 1; i <= n; i++)
{
for (int j = i; j <= n; j++)
printf("%d ", rmq(i, j));
printf("\n");
}
}
/*
debuge_sa:
ABABABAB
0 4 0
1 8 0
2 3 2
3 7 4
4 2 6
5 6 0
6 1 1
7 5 3
8 0 5
^^^^^^^^^^^^^^
0 8
1 6
2 4
3 2
4 0
5 7
6 5
7 3
8 1
^^^^^^^^^^^^^^
0 2 2 2 0 0 0 0
2 4 4 0 0 0 0
4 6 0 0 0 0
0 0 0 0 0
0 1 1 1
1 3 3
3 5
0
*/
自己的解法：
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#define REP(i, n) for(int i=0; i<n; i++)
#define CLR(a, b) memset(a, b, sizeof(a))
#define PB push_back
#define LL long long
using namespace std;
const int MAXN = 1010 * 100;
const int INF = 0x3f3f3f3f;
int wa[MAXN], wb[MAXN], wv[MAXN], wn[MAXN];
char r[MAXN];
int a[MAXN], sa[MAXN], rank[MAXN], height[MAXN];
int idx[MAXN];
int idf[MAXN];
int _left[MAXN], _right[MAXN];
int cmp(int *r, int a,int b, int k)
{
return r[a] == r[b] && r[a + k] == r[b + k];
}
void build_sa(int *r, int *sa, int n,int m)
{
int i,j, p;
int *x = wa, *y = wb, *t;
for (int i= 0; i < m; i++) wn[i] = 0;
for (int i= 0; i < n; i++) wn[x[i] = r[i]]++;
for (int i = 1; i < m; i++) wn[i] += wn[i - 1];
for (int i = n - 1; i >= 0; i--) sa[--wn[x[i]]] = i;
for (p = 1, j = 1; p < n; j <<= 1, m = p)
{
for (p = 0, 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++) wn[i] = 0;
for (i = 0; i < n; i++) wn[wv[i] = x[y[i]]]++;
for (i = 1; i < m; i++) wn[i] += wn[i - 1];
for (i = n - 1; i >= 0; i--) sa[--wn[wv[i]]] = y[i];
t = x; x = y; y = t;
x[sa[0]] = 0; p = 1;
for (i = 1; i < n; i++)
x[sa[i]] = cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++;
}
}
void getHeight(int *r, int *sa, int n)
{
int i, j, k = 0;
for (i = 1; i <= n; i++)
{
rank[sa[i]] = i;
height[i] = 0;
}
for (i = 0;i < n; i++)
{
if (k) k--;
j = sa[rank[i] - 1];
while (r[i + k] == r[j + k]) k++;
height[rank[i]] = k;
}
}
int h[MAXN][30];
void init_rmq(int n)
{
for (int i = 1; i <= n; i++) h[i][0] = height[i];
for (int j = 1; (1 << j) <= n; j++)
{
for (int i = 1; i + (1 << j) - 1 <= n; i++)
h[i][j] = min(h[i][j - 1], h[i + (1 << (j - 1))][j - 1]);
}
}
int rmq(int L, int R)
{
if (L > R) swap(L, R);
L++;
int k = 0; while ((1 << (k + 1)) <= (R - L + 1)) k++;
return min(h[L][k], h[R - (1 << k) + 1][k]);
}
inline int getid(int x)
{
return idx[sa[x]];
}
int n, m;
void pre()
{
int p[2][2];
p[0][0] = p[1][0] = n + 1;
p[0][1] = p[1][1] = 0;
for (int i = n; i >= 1; i--)
{
int idi = getid(i);
if (idi)
{
if (idi == p[0][1])
{
_right[i] = p[1][0];
p[0][0] = i;
}
else
{
_right[i] = p[0][0];
swap(p[0], p[1]);
p[0][0] = i; p[0][1] = idi;
}
}
}
p[0][0] = p[1][0] = 0;
p[0][1] = p[1][1] = 0;
for (int i = 1; i <= n; i++)
{
int idi = getid(i);
if (idi)
{
if (idi == p[0][1])
{
_left[i] = p[1][0];
p[0][0] = i;
}
else
{
_left[i] = p[0][0];
swap(p[0], p[1]);
p[0][0] = i; p[0][1] = idi;
}
}
}
}
inline int get(int i)
{
int ans = 0;
if (_left[i]) ans = max(rmq(_left[i], i), ans);
if (_right[i] != n + 1) ans = max(rmq(_right[i], i), ans);
return ans;
}
void solve()
{
init_rmq(n);
pre();
int p[2];
p[0] = INF; p[1] = 0;
for (int i = 0; i <= n; i++)
{
if (idx[i])
{
int x = get(rank[i]); x++;
if (x <= idf[idx[i]] - i && p[0] > x) p[0] = x, p[1] = i;
}
else
{
for (int j = p[1]; j < p[1] + p[0]; j++)
printf("%c", (char)a[j]);
printf("\n");
p[0] = INF; p[1] = i + 1;
}
}
}
int main()
{
int t, i, l;
while (~scanf("%d", &t))
{
n = 0;
m = 256;
CLR(idx, 0);
for(int i = 1; i <= t; i++)
{
scanf("%s", r);
l = strlen(r);
REP(j, l)
{
a[n] = (int)r[j];
idx[n++] = i;
}
idf[i] = n;
a[n++] = m++;
}
a[--n] = 0;
build_sa(a, sa, n + 1, m);
getHeight(a, sa, n);
solve();
}
return 0;
}
参考别人的犀利解法：
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#define REP(i, n) for(int i=0; i<n; i++)
#define CLR(a, b) memset(a, b, sizeof(a))
#define PB push_back
#define LL long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1010 * 100;
int wa[MAXN], wb[MAXN], wv[MAXN], wn[MAXN];
char r[MAXN];
int a[MAXN], sa[MAXN], rank[MAXN], height[MAXN];
int idx[MAXN];
int cmp(int *r, int a,int b, int k)
{
return r[a] == r[b] && r[a + k] == r[b + k];
}
void build_sa(int *r, int *sa, int n,int m)
{
int i,j, p;
int *x = wa, *y = wb, *t;
for (int i= 0; i < m; i++) wn[i] = 0;
for (int i= 0; i < n; i++) wn[x[i] = r[i]]++;
for (int i = 1; i < m; i++) wn[i] += wn[i - 1];
for (int i = n - 1; i >= 0; i--) sa[--wn[x[i]]] = i;
for (p = 1, j = 1; p < n; j <<= 1, m = p)
{
for (p = 0, 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++) wn[i] = 0;
for (i = 0; i < n; i++) wn[wv[i] = x[y[i]]]++;
for (i = 1; i < m; i++) wn[i] += wn[i - 1];
for (i = n - 1; i >= 0; i--) sa[--wn[wv[i]]] = y[i];
t = x; x = y; y = t;
x[sa[0]] = 0; p = 1;
for (i = 1; i < n; i++)
x[sa[i]] = cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++;
}
}
void getHeight(int *r, int *sa, int n)
{
int i, j, k = 0;
for (i = 1; i <= n; i++)
{
rank[sa[i]] = i;
height[i] = 0;
}
for (i = 0;i < n; i++)
{
if (k) k--;
j = sa[rank[i] - 1];
while (r[i + k] == r[j + k]) k++;
height[rank[i]] = k;
}
}
inline int getid(int x) { return idx[sa[x]]; }
int n, m;
int ll[MAXN], rr[MAXN];///left记录sa中i位置的左边第一个不是同一串的后缀之间的lcp，rr同理。没有则值为0
void pre()
{
CLR(ll, 0); CLR(rr, 0);
for (int i = 2; i <= n; i++)
{
if (getid(i) != getid(i - 1)) ll[i] = height[i];
else ll[i] = min(ll[i - 1], height[i]);
}
for (int i = n - 1; i >= 1; i--)
{
if (getid(i) != getid(i + 1)) rr[i] = height[i + 1];
else rr[i] = min(rr[i + 1], height[i + 1]);
}
}
void solve()
{
pre();
int p[2];
p[0] = INF; p[1] = 0;
for (int i = 0; i <= n; i++)
{
if (idx[i])
{
int x = max(ll[rank[i]], rr[rank[i]]); x++;
if (idx[i + x - 1] == idx[i] && p[0] > x) p[0] = x, p[1] = i;///判断是否超过长度
}
else
{
for (int j = p[1]; j < p[1] + p[0]; j++)
printf("%c", (char)a[j]);
printf("\n");
p[0] = INF; p[1] = 0;
}
}
}
int main()
{
int t, i, l;
while (~scanf("%d", &t))
{
n = 0;
m = 256;
CLR(idx, 0);
for(int i = 1; i <= t; i++)
{
scanf("%s", r);
l = strlen(r);
REP(j, l)
{
a[n] = (int)r[j];
idx[n++] = i;
}
a[n++] = m++;
}
a[--n] = 0;
build_sa(a, sa, n + 1, m);
getHeight(a, sa, n);
solve1();
}
return 0;
}
861
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
