求两个子串的最长公共前缀
HDU4691:http://acm.hdu.edu.cn/showproblem.php?pid=4691
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 1e5 + 100;
typedef long long LL;
char s[MAXN]; int ss[MAXN]; int l[MAXN],r[MAXN];
struct Suf{
int wa[MAXN],wb[MAXN],wv[MAXN],ws[MAXN];
int sa[MAXN],rank[MAXN],het[MAXN];
int cmp(int *r,int a,int b,int l)
{
return r[a] == r[b] && r[a+l] == r[b+l];
}
void da(int *r,int n,int m)
{
int i,j,k,p,*x = wa,*y = wb,*t;
for(i=0;i<m;i++) ws[i] = 0;
for(i=0;i<n;i++) ws[x[i]=r[i]]++;
for(i=1;i<m;i++) ws[i]+=ws[i-1];
for(i=n-1;i>=0;i--) sa[--ws[x[i]]]=i;
for(j=1,p=1;p<n;j*=2,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<n;i++) wv[i] = x[y[i]];
for(i=0;i<m;i++) ws[i] = 0;
for(i=0;i<n;i++) ws[wv[i]]++;
for(i=1;i<m;i++) ws[i]+=ws[i-1];
for(i=n-1;i>=0;i--) sa[--ws[wv[i]]] = y[i];
for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;i++)
x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;
}
k = 0 ;
for (i=1;i<n;i++) rank[sa[i]] = i;
for (i=0;i<n-1;het[rank[i++]] = k)
for (k?k--:0,j=sa[rank[i]-1];r[i+k] == r[j+k];k++);
return;
}
int tmp[25],f[MAXN][25],log2[MAXN];
void rmq(int n)
{
int i,j; tmp[0] = 1;
for(i=1;i<20;i++) tmp[i] = tmp[i-1]*2;
log2[0] = -1;
for(i=1;i<=n;i++) log2[i] = (i&(i-1)) ? log2[i-1]:log2[i-1]+1;
for(i=1;i<=n;i++) f[i][0] = het[i];
for(j=1;j<20;j++) for(i=1;i+tmp[j]-1<=n;i++)
f[i][j] = min(f[i][j-1],f[i+tmp[j-1]][j-1]);
}
int lcp(int a,int b)
{
int x = rank[a], y = rank[b];
if( x>y ) swap(x,y);
x++;
int k = log2[y-x+1];
return min(f[x][k],f[y-tmp[k]+1][k]);
}
}arr;
int get(int x)
{
int i = 0;
if(x==0) return 1;
while(x)
{
i++;
x/=10;
}
return i;
}
int main()
{
while( scanf(" %s",s)!=EOF)
{
int len = strlen(s);
ss[len] = 0;
for(int i=0;i<len;i++) ss[i] = s[i]-'a'+1;
arr.da(ss,len+1,27);
arr.rmq(len+1);
LL ans1 = 0, ans2 = 0;
int m;
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d",&l[i],&r[i]); r[i]--;
ans1 += (LL)r[i] - l[i] + 2;
if(i==1)
ans2 = (LL)r[i] - l[i] + 1 + 3;
else
{
//from here:
int add;
if(l[i]==l[i-1]) add = min((LL)r[i]-l[i]+1,(LL)r[i-1]-l[i-1]+1);
else add = arr.lcp(l[i-1],l[i]);
add = min(add,min(r[i]-l[i]+1,r[i-1]-l[i-1]+1));
//end here注意求子串和求后缀的区别。。
ans2 += get(add) + 1 + (LL)r[i]-l[i]+1-add + 1;
}
}
printf("%I64d %I64d\n",ans1,ans2);
}
return 0;
}
不可重叠的长度至少为k的最长重复子串
不可重叠的最长重复子串 和 不可重叠的长度至少为k的最长重复子串做法类似,都是二分区间,但是二者二分区间的长度不同,其他的别无她意。
http://poj.org/problem?id=1743
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <climits>
using namespace std;
const int MAXN = 20050;
int ss[MAXN];
struct Suf{
int wa[MAXN],wb[MAXN],wv[MAXN],ws[MAXN];
int sa[MAXN],rank[MAXN],het[MAXN];
int cmp(int *r,int a,int b,int l)
{
return r[a] == r[b] && r[a+l] == r[b+l];
}
void da(int *r,int n,int m)
{
int i,j,k,p,*x = wa,*y = wb,*t;
for(i=0;i<m;i++) ws[i] = 0;
for(i=0;i<n;i++) ws[x[i]=r[i]]++;
for(i=1;i<m;i++) ws[i]+=ws[i-1];
for(i=n-1;i>=0;i--) sa[--ws[x[i]]]=i;
for(j=1,p=1;p<n;j*=2,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<n;i++) wv[i] = x[y[i]];
for(i=0;i<m;i++) ws[i] = 0;
for(i=0;i<n;i++) ws[wv[i]]++;
for(i=1;i<m;i++) ws[i]+=ws[i-1];
for(i=n-1;i>=0;i--) sa[--ws[wv[i]]] = y[i];
for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;i++)
x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;
}
k = 0 ;
for (i=1;i<n;i++) rank[sa[i]] = i;
for (i=0;i<n-1;het[rank[i++]] = k)
for (k?k--:0,j=sa[rank[i]-1];r[i+k] == r[j+k];k++);
return;
}
bool check(int x,int n)
{
int i = 1;
while(true)
{
while( i<n-1 && het[i] < x ) i++;
if(i>=n-1) break;
int L = sa[i-1];
int R = sa[i-1];
while( i<n-1 && het[i] >= x)
{
L = min(L,sa[i]);
R = max(R,sa[i]);
i++;
}
if( R - L >=x ) return true;
}
return false;
}
}arr;
int main()
{
int n;
while( scanf("%d",&n)!=EOF && n)
{
int prex; scanf("%d",&prex);
for(int i=0;i<n-1;i++)
{
int x;
scanf("%d",&x);
ss[i] = x-prex + 88;
prex = x;
}
ss[n-1] = 0;
arr.da(ss,n,176);
int L = 4, R = n/2; bool flag = false;
while( L <= R )
{
int mid = (L+R) >>1;
if( arr.check(mid,n) ) L = mid+1,flag = true;
else R = mid-1;
}
int ans = flag ? L : 0;
printf("%d\n",ans);
}
return 0;
}