poj3415 Common Substrings

http://www.elijahqi.win/2018/02/23/poj3415/
Description

A substring of a string T is defined as:

T(i, k)=TiTi+1…Ti+k-1, 1≤i≤i+k-1≤|T|.
Given two strings A, B and one integer K, we define S, a set of triples (i, j, k):

S = {(i, j, k) | k≥K, A(i, k)=B(j, k)}.
You are to give the value of |S| for specific A, B and K.

Input

The input file contains several blocks of data. For each block, the first line contains one integer K, followed by two lines containing strings A and B, respectively. The input file is ended by K=0.

1 ≤ |A|, |B| ≤ 105
1 ≤ K ≤ min{|A|, |B|}
Characters of A and B are all Latin letters.

Output

For each case, output an integer |S|.

Sample Input

2
aababaa
abaabaa
1
xx
xx
0
Sample Output

22
5
Source

POJ Monthly–2007.10.06, wintokk
单调栈+sa 思考了很久的这题
求有多少个子串分别属于A,B并且他们的lcp>=k
那么首先一个显然的想法是枚举每个后缀把他们的lcp加起来 但是这不okay 时间T飞
那考虑怎么办 要多多利用前面的信息才可以 维护一个递增的序列 只进不出 然后num1 num2分别记录的是满足当前height的情况下 我如果新来一个其他串的子串我可以和他们构成多少个子串
为什么要维护递增的 保证我修改的复杂度不会回撤太多 但是想了想也许也可以给卡死的吧 想办法构造height是递减的即可qwq不知道能否构造这样的数据 然后每次做的时候先把上一个串的影响入队 并且加到num里面 然后再做我这个串的时候判断我是第一个还是第二个串 分别加上不同的num 然后刚刚那个回撤操作其实是要把多的影响减去 因为被我当前这个height限制住了 我两个后缀的lcp是 他们之间的最小值才对 大概看代码还是可以理解的

#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
#define N 220000
using namespace std;
int sa[N],rk[N<<1],rk1[N<<1],tmp[N],n,m,height[N],q[N],top,cnt[N],k,kk,mark[N];
char s[N];
int main(){
    freopen("poj3415.in","r",stdin);
    while(~scanf("%d",&kk)&&kk){
        scanf("%s",s+1);int n=strlen(s+1);s[++n]='#';int len=n;
        scanf("%s",s+n+1);n=strlen(s+1);m=255;memset(rk,0,sizeof(rk));memset(rk1,0,sizeof(rk1));
        for (int i=1;i<=m;++i) cnt[i]=0;k=0;
        for (int i=1;i<=n;++i) cnt[s[i]]=1;
        for (int i=1;i<=m;++i) cnt[i]+=cnt[i-1];
        for (int i=1;i<=n;++i) rk[i]=cnt[s[i]];
        for (int p=1;k!=n;p<<=1,m=k){
            for (int i=1;i<=m;++i) cnt[i]=0;
            for (int i=1;i<=n;++i) ++cnt[rk[i+p]];
            for (int i=1;i<=m;++i) cnt[i]+=cnt[i-1];
            for (int i=n;i;--i) tmp[cnt[rk[i+p]]--]=i;
            for (int i=1;i<=m;++i) cnt[i]=0;
            for (int i=1;i<=n;++i) ++cnt[rk[i]];
            for (int i=1;i<=m;++i) cnt[i]+=cnt[i-1];
            for (int i=n;i;--i) sa[cnt[rk[tmp[i]]]--]=tmp[i];
            memcpy(rk1,rk,sizeof(rk)>>1);rk[sa[1]]=k=1;
            for (int i=2;i<=n;++i){
                if (rk1[sa[i]]!=rk1[sa[i-1]]||rk1[sa[i]+p]!=rk1[sa[i-1]+p]) ++k;
                rk[sa[i]]=k;
            }
        }k=0;ll ans=0,num[3]={0};
        for (int i=1;i<=n;++i){
            if (rk[i]==1) continue;
            k=k==0?0:k-1;
            while(s[i+k]==s[sa[rk[i]-1]+k]) ++k;
            height[rk[i]]=k;
        }
        for (int i=1;i<=n;++i){
            if (height[i]<kk) top=num[1]=num[2]=0;else{
                for (int j=top;j&&q[j]>height[i]-kk+1;--j)
                    num[mark[j]]-=q[j]-height[i]+kk-1,q[j]=height[i]-kk+1;
                q[++top]=height[i]-kk+1;mark[top]=sa[i-1]<len?1:2;
                num[mark[top]]+=height[i]-kk+1;ans+=sa[i]<len?num[2]:num[1];
            }
        }printf("%lld\n",ans);
    }
    return 0;
}