1
给定一个字符串,求最长重复子串,这两个子串不能重叠。
http://poj.org/problem?id=1743
题目意思是求不重叠的最长相同变化的子串,输出该长度
先二分答案,判断是否 存在两个长度为 k 的子串是相同的,且不重叠。利用 height 数组。把排序后的后缀分成若干组,其中每组的后缀之间的 height 值都
不小于 k。这一组内任意两个都是可以的,于是找到距离最远的两个看是不是>k(保证不重叠)
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 20010;
int b,a[maxn],n;
typedef pair<int,int> pii;
int A[maxn],B[maxn];
int realrank[maxn],k;
pii st[maxn];
int s[maxn][2];
int h[maxn];
int C[maxn],D[maxn];
void init(){
int tmp = 0;
for(int i = 1; i <= n ; i++){
scanf("%d",&b);
a[i] = b-tmp;
tmp = b;
}
//a[1] = 0;
for(int i = 1; i <= n ; i++){
st[i] = make_pair(a[i],i);
}
sort(st+1,st+1+n);
k = realrank[st[1].second] = 1;
for(int i = 2; i <= n ; i++){
if(st[i].first != st[i-1].first)
k +=1;
realrank[st[i].second] = k;
}
}
void suffix_array(){
for(int i = 1; i <= n ; i *= 2){
for(int j = 0 ; j <= n ; j++)
A[j] = B[j] = 0;
for(int j = 1; j <= n ; j++){
A[s[j][0] = realrank[j]]++;
if(j+i <= n)
s[j][1] = realrank[j+i];
else s[j][1] = 0;
B[s[j][1]]++;
}
for(int j = 1; j <= n ;j++)
A[j] += A[j-1],B[j] += B[j-1];
for(int j = n ; j >= 1; j--){
C[B[s[j][1]]] = j;
B[s[j][1]]--;
}
for(int j = n ; j >=1; j--){
D[A[s[C[j]][0]]] = C[j];
A[s[C[j]][0]]--;
}
k = realrank[D[1]] = 1;
for(int j = 2 ; j <= n ; j++){
if(s[D[j]][0] != s[D[j-1]][0] ||s[D[j]][1] != s[D[j-1]][1])
k++;
realrank[D[j]] = k;
}
}
}
void gethigh(){
int pre = 0,j;
for(int i = 1; i <= n ; i++){
if(pre) pre--;
j = D[realrank[i]-1];
while(i+pre <= n && j + pre <= n && a[i+pre] == a[j+pre])
pre++;
h[realrank[i]] = pre;
//printf("%d h[%d] = %d\n",i ,realrank[i],h[realrank[i]]);
}
}
bool check(int num){
num--;
//printf("num = %d\n",num);
int maxn = -(1<<20),minn = (1<<20);
for(int j = 2; j <= n ; j++){
if(h[j] < num){
// printf("j = %d\n",j);
if(maxn-minn > num)
return true;
maxn = -(1<<20),minn = (1<<20);
}
else{
//printf("j = %d D = %d %d\n",j,D[j],D[j-1]);
maxn = max(maxn,D[j-1]);
maxn = max(maxn,D[j]);
minn = min(minn,D[j]);
minn = min(minn,D[j-1]);
if(maxn-minn > num)
return true;
//printf("maxn = %d minn = %d\n",maxn,minn);
}
}
return false;
}
void sov(){
int L = 5,R = n/2+1,ans = 0;
while( L <= R){
int mid = (L + R) >> 1;
if(check(mid)){
L = mid+1;
ans = max(ans,mid);
}
else R = mid-1;
}
printf("%d\n",ans);
}
int main(){
while(~scanf("%d",&n) && n){
if(n < 10){
for(int i = 0 ; i < n ; i++) scanf("%d",&b);
printf("0\n");
continue;
}
init();
suffix_array();
gethigh();
sov();
}
}
B
:可重叠的 k 次最长重复子串
http://poj.org/problem?id=3261
给定一个字符串,求至少出现 k 次的最长重复子串,这 k 个子串可以重叠。
这题的做法和上一题差不多,也是先二分答案,然后将后缀分成若干组。判断的是有没有一个组的后缀个数不小于 k。
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 20010;
int b,a[maxn],n,m;
typedef pair<int,int> pii;
int A[maxn],B[maxn];
int realrank[maxn],k;
pii st[maxn];
int s[maxn][2];
int h[maxn];
int C[maxn],D[maxn];
void init(){
int tmp = 0;
for(int i = 1; i <= n ; i++)
scanf("%d",&a[i]);
for(int i = 1; i <= n ; i++){
st[i] = make_pair(a[i],i);
}
sort(st+1,st+1+n);
k = realrank[st[1].second] = 1;
for(int i = 2; i <= n ; i++){
if(st[i].first != st[i-1].first)
k +=1;
realrank[st[i].second] = k;
}
}
void suffix_array(){
for(int i = 1; i <= n ; i *= 2){
for(int j = 0 ; j <= n ; j++)
A[j] = B[j] = 0;
for(int j = 1; j <= n ; j++){
A[s[j][0] = realrank[j]]++;
if(j+i <= n)
s[j][1] = realrank[j+i];
else s[j][1] = 0;
B[s[j][1]]++;
}
for(int j = 1; j <= n ;j++)
A[j] += A[j-1],B[j] += B[j-1];
for(int j = n ; j >= 1; j--){
C[B[s[j][1]]] = j;
B[s[j][1]]--;
}
for(int j = n ; j >=1; j--){
D[A[s[C[j]][0]]] = C[j];
A[s[C[j]][0]]--;
}
k = realrank[D[1]] = 1;
for(int j = 2 ; j <= n ; j++){
if(s[D[j]][0] != s[D[j-1]][0] ||s[D[j]][1] != s[D[j-1]][1])
k++;
realrank[D[j]] = k;
}
}
}
void gethigh(){
int pre = 0,j;
for(int i = 1; i <= n ; i++){
if(pre) pre--;
j = D[realrank[i]-1];
while(i+pre <= n && j + pre <= n && a[i+pre] == a[j+pre])
pre++;
h[realrank[i]] = pre;
}
//printf("realrank[2] = %d h = %d\n",realrank[4],h[5]);
}
bool check(int num){
int cnt = 0;
for(int j = 2; j <= n ; j++){
if(h[j] < num){
if(cnt >= m-1)
return true;
cnt = 0;
}
else{
cnt++;
if(cnt >= m-1)
return true;
}
}
return false;
}
void sov(){
int L = 1,R = n,ans = 0;
while( L <= R){
int mid = (L + R) >> 1;
if(check(mid)){
L = mid+1;
ans = max(ans,mid);
}
else R = mid-1;
}
printf("%d\n",ans);
}
int main(){
while(~scanf("%d%d",&n,&m)){
init();
suffix_array();
gethigh();
sov();
}
}