bzoj3277

http://www.elijahqi.win/archives/609
竟然和bzoj3473一模一样，不过数据应该是增强了

#include<cstdio>
#include<cstring>
#define N 220000
int m,nn,n1,k,n,kk;
int a[N],rank[N<<1],rank1[N],sa[N],tmp[N],count[N],height[N],fmin[N][20];
int bl[N],cnt[N],L[N],Log[N];
char str1[N];
struct node{
    int st,ed;
}data[N>>1];
inline int min(int x,int y){return x<y?x:y; }
inline int lcp(int x,int y){
    x++;int t=y-x+1;t=Log[t];
    return min(fmin[x][t],fmin[y-(1<<t)+1][t]);
}
bool check(int st,int len){ //串sa[st]->sa[st+len-1]是否满足题目的条件 
    int l1,r1;//二分的目标是找到最大的sa区间，使包含sa[st]..sa[st]+len-1 
    if (height[st]<len) l1=st;else{
        int l=1,r=st-1;
        while (l<=r){
            int mid=(l+r)>>1;
            if(lcp(mid,st)>=len) r=mid-1;else l=mid+1;
        }
        l1=l;
    }
    if (height[st+1]<len) r1=st;else{
        int l=st+1,r=n;
        while (l<=r){
            int mid=(l+r)>>1;
            if (lcp(st,mid)>=len) l=mid+1;else r=mid-1;
        }
        r1=r;
    } 
    return L[r1]>=l1;//L[r1]到r1的区间肯定包含了kk及以上不同的字串，判断l1->r1的区间能否包含 
}
int main(){
    freopen("bzoj3277.in","r",stdin);
    scanf("%d%d",&n1,&kk);
    m=30;n=1;
    for (int i=1;i<=n1;++i){
        scanf("%s",str1);nn=strlen(str1);data[i].st=n;
        for (int j=0;j<nn;++j) a[j+n]=str1[j]-'a'+1,bl[j+n]=i;
        n+=nn;data[i].ed=n-1;a[n++]=m++;
    }n-=1;
//  for (int i=1;i<=n1;++i) printf("%d %d\n",data[i].st,data[i].ed);
//  for (int i=1;i<=n;++i) printf("%d ",a[i]);  
    for (int i=1;i<=n;++i) count[a[i]]=1;
    for (int i=1;i<=n+255;++i) count[i]+=count[i-1];
    for (int i=1;i<=n;++i) rank[i]=count[a[i]];
    for (int p=1;k!=n;p<<=1,m=k){
        for (int i=1;i<=m;++i) count[i]=0;
        for (int i=1;i<=n;++i) count[rank[i+p]]++;
        for (int i=1;i<=m;++i) count[i]+=count[i-1];
        for (int i=n;i>=1;--i) tmp[count[rank[i+p]]--]=i;
        for (int i=1;i<=m;++i) count[i]=0;
        for (int i=1;i<=n;++i) count[rank[i]]++;
        for (int i=1;i<=m;++i) count[i]+=count[i-1];
        for (int i=n;i>=1;--i) sa[count[rank[tmp[i]]]--]=tmp[i];
        memcpy(rank1,rank,sizeof(rank)>>1);
        rank[sa[1]]=k=1;
        for (int i=2;i<=n;++i){
            if (rank1[sa[i]]!=rank1[sa[i-1]]||rank1[sa[i]+p]!=rank1[sa[i-1]+p]) ++k;
            rank[sa[i]]=k;
        }
    }
/*  for (int i=1;i<=n;++i){
        for (int j=sa[i];j<=n;++j) printf("%c",a[j]+'a'-1);printf("\n");
    }*/
    //for (int i=1;i<=n;++i) printf("%d ",rank[i]);printf("\n");
    k=0;
    for (int i=1;i<=n;++i){
        if (rank[i]==1) continue;
        k=k==0?0:k-1;
        while (a[i+k]==a[sa[rank[i]-1]+k]) ++k;
        height[rank[i]]=k;
    }
    //for (int i=1;i<=n;++i) printf("%d ",height[i]);
    Log[0]=-1;
    for (int i=1;i<=n;++i) Log[i]=Log[i>>1]+1;
//  for (int i=1;i<=n;++i) printf("%d ",Log[i]);
    for (int i=1;i<=n;++i) fmin[i][0]=height[i];
    for (int j=1;j<=Log[n];++j){
        for (int i=1;i<=n-(1<<j)+1;++i){
            fmin[i][j]=min(fmin[i][j-1],fmin[i+(1<<(j-1))][j-1]);
        }
    }
    //o(n)求l数组
    int num=0;
    for (int i=1,p=1;i<=n;++i){
        if (!bl[sa[i]])break;//因为前面的设定，如果遇到分隔符，自动退出 
        if (cnt[bl[sa[i]]]==0) num++;//如果不存在这一块 则计数器+1
        cnt[bl[sa[i]]]++;
        while (num>kk||num==kk&&cnt[bl[sa[p]]]>1){
            --cnt[bl[sa[p]]];if(cnt[bl[sa[p++]]]==0) num--;
        } 
        if(num>=kk) L[i]=p;else L[i]=-1;
    } 
    //for (int i=1;i<=n;++i) printf("%d ",L[i]);
    for (int i=1;i<=n1;++i){
        long long ans=0;int k=0;
        for (int j=data[i].st;j<=data[i].ed;++j){
            k=k==0?0:k-1;
            while (j+k<=data[i].ed&&check(rank[j],k+1)) ++k;//检查一下rank[j]这个后缀是否满足k+1这个长度的条件 
            ans+=k;
        }
        printf("%lld",ans);if (i!=n1) printf(" ");
    }
    return 0;
}