UVA10298 Power Strings
Lingk
一.后缀数组(2.8s)
比较是否有长度为k的最小循环节, 直接找LCP(1, 1 + K)是否等于n - k即可
eg ababababab
长度为2的最小循环节则LCP(1, 3) == 8;
倍增方法偏慢常数过大, 正解为DC3方法
倍增能过洛谷上的题2.8秒
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
#define ll long long
const int N = 1000010;
int n, m;
char s[N];
int sa[N], x[N], y[N], c[N], rk[N], height[N], base[N], f[N][30];
void get_sa()
{
for (int i = 1; i <= n; i ++ ) c[x[i] = s[i]] ++ ;
for (int i = 2; i <= m; i ++ ) c[i] += c[i - 1];
for (int i = n; i; i -- ) sa[c[x[i]] -- ] = i;
for (int k = 1; k <= n; k <<= 1)
{
int num = 0;
for (int i = n - k + 1; i <= n; i ++ ) y[ ++ num] = i;
for (int i = 1; i <= n; i ++ )
if (sa[i] > k)
y[ ++ num] = sa[i] - k;
for (int i = 1; i <= m; i ++ ) c[i] = 0;
for (int i = 1; i <= n; i ++ ) c[x[i]] ++ ;
for (int i = 2; i <= m; i ++ ) c[i] += c[i - 1];
for (int i = n; i; i -- ) sa[c[x[y[i]]] -- ] = y[i], y[i] = 0;
swap(x, y);
x[sa[1]] = 1, num = 1;
for (int i = 2; i <= n; i ++ )
x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k]) ? num : ++ num;
if (num == n) break;
m = num;
}
}
void get_height()
{
for (int i = 1; i <= n; i ++ ) rk[sa[i]] = i;
for (int i = 1, k = 0; i <= n; i ++ )
{
if (rk[i] == 1) continue;
if (k) k -- ;
int j = sa[rk[i] - 1];
while (i + k <= n && j + k <= n && s[i + k] == s[j + k]) k ++ ;
height[rk[i]] = k;
}
}
void init_rmq()
{
base[0] = -1;
for(int i = 1; i <= n; i ++)
{
f[i][0] = height[i];
base[i] = base[i>>1] + 1;
}
for(int j = 1; j <= 18; j ++)
{
for(int i = 1; i + (1 << (j - 1)) <= n; i++)
{
f[i][j] = min(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
}
}
}
int LCP(int x, int y) //第x和第y个后缀(不是排名)的最长公共前缀
{
if(x == y) return n - x + 1;
x = rk[x], y = rk[y];
if(x > y) swap(x, y);
x ++;
int t = base[y - x + 1];
return min(f[x][t], f[y - (1 << t) + 1][t]);
}
void init()
{
memset(c, 0, sizeof c);
memset(x, 0, sizeof x);
}
int main()
{
while(~scanf("%s",s + 1) && s[1] != '.')
{
init();
n = strlen(s + 1);
m = 222;
get_sa();
get_height();
init_rmq();
int l, r;
int ans = n;
for(int i = 1; i < n; i++)
{
if(n % i == 0 && LCP(1, i + 1) == n - i)
{
ans = i;
break;
}
}
printf("%d\n", n / ans);
}
return 0;
}
kmp(96ms)
利用next数组, 如果next[n]表示模式串中前后缀中最长的距离, 设这个距离t = next[n], m = n - t, 如果n%m == 0则存在最小循环节,画出图即可理解
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1e6 + 10, M = 1e6 + 10;
int n, m;
char s[N], p[N];
int ne[N];
void get_ne()
{
for(int i = 2, j = 0; i <= n; i ++) // ne[1] = 0, 所以直接从2开始
{
while(j && p[i] != p[j + 1]) j = ne[j];
if(p[i] == p[j + 1]) j ++;
ne[i] = j;
}
}
void kmp()
{
for(int i = 1, j = 0; i <= m; i ++)
{
while(j && s[i] != p[j + 1]) j = ne[j];
if(s[i] == p[j + 1]) j ++;
if(j == n)
{
cout << i - n << endl;
cout << "匹配成功" << endl;
j = ne[j];
}
}
}
int main()
{
while(scanf("%s", p + 1) && p[1] != '.')
{
n = strlen(p + 1);
get_ne();
int t = n - ne[n];
if(n % t == 0)
{
cout << n / t << endl;
}
else
cout << 1 << endl;
}
}
3 hash(204ms)
原理和kmp类似, 通过枚举找到最长相同前缀和后缀
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1e6 + 10;
char s[N];
int n;
unsigned long long hsh[N], base[N], pre = 2333333;
unsigned long long get_hsh(int l, int r)
{
return hsh[r] - hsh[l - 1] * base[r - l + 1];
}
bool check(int x)
{
int t1 = n - x;
// for(int i = 1; i <= t1; i ++)
// {
// cout << s[i];
// }
// cout << endl;
// for(int i = x + 1; i <= n; i ++)
// {
// cout << s[i];
// }
// cout << endl;
return get_hsh(1, t1) == get_hsh(x + 1, n);
}
int main()
{
while(scanf("%s",s + 1) && s[1] != '.')
{
base[0] = 1;
n = strlen(s + 1);
for(int i = 1; i <= n; i++)
{
hsh[i] = hsh[i - 1] * pre + s[i];
base[i] = base[i - 1] * pre;
}
int ans = n;
for(int i = 1; i <= n; i++)
{
if(n % i == 0)
{
if(check(i))
{
ans = i;
break;
}
}
}
cout << n / ans << endl;
}
return 0;
}