poj 2774 Long Long Message 后缀数组

最新推荐文章于 2020-02-07 11:05:28 发布

原创最新推荐文章于 2020-02-07 11:05:28 发布 · 480 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#acm #后缀数组

acm_数据结构同时被 2 个专栏收录

33 篇文章

订阅专栏

acm_后缀数组

1 篇文章

订阅专栏

本文介绍了一种通过计算两个字符串的最长公共子串来解决实际问题的方法。具体场景为帮助一个小猫找出其发送给母亲短信的原始内容长度，以此来评估花费在短信上的费用。文章提供了一个详细的代码实现，使用了后缀数组和高度数组来高效地解决问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

点击打开链接题目链接

Long Long Message

Time Limit: 4000MS		Memory Limit: 131072K
Total Submissions: 23327		Accepted: 9566
Case Time Limit: 1000MS

Description

The little cat is majoring in physics in the capital of Byterland. A piece of sad news comes to him these days: his mother is getting ill. Being worried about spending so much on railway tickets (Byterland is such a big country, and he has to spend 16 shours on train to his hometown), he decided only to send SMS with his mother.

The little cat lives in an unrich family, so he frequently comes to the mobile service center, to check how much money he has spent on SMS. Yesterday, the computer of service center was broken, and printed two very long messages. The brilliant little cat soon found out:

1. All characters in messages are lowercase Latin letters, without punctuations and spaces.
2. All SMS has been appended to each other – (i+1)-th SMS comes directly after the i-th one – that is why those two messages are quite long.
3. His own SMS has been appended together, but possibly a great many redundancy characters appear leftwards and rightwards due to the broken computer.
E.g: if his SMS is “motheriloveyou”, either long message printed by that machine, would possibly be one of “hahamotheriloveyou”, “motheriloveyoureally”, “motheriloveyouornot”, “bbbmotheriloveyouaaa”, etc.
4. For these broken issues, the little cat has printed his original text twice (so there appears two very long messages). Even though the original text remains the same in two printed messages, the redundancy characters on both sides would be possibly different.

You are given those two very long messages, and you have to output the length of the longest possible original text written by the little cat.

Background:
The SMS in Byterland mobile service are charging in dollars-per-byte. That is why the little cat is worrying about how long could the longest original text be.

Why ask you to write a program? There are four resions:
1. The little cat is so busy these days with physics lessons;
2. The little cat wants to keep what he said to his mother seceret;
3. POJ is such a great Online Judge;
4. The little cat wants to earn some money from POJ, and try to persuade his mother to see the doctor :(

Input

Two strings with lowercase letters on two of the input lines individually. Number of characters in each one will never exceed 100000.

Output

A single line with a single integer number – what is the maximum length of the original text written by the little cat.

Sample Input

yeshowmuchiloveyoumydearmotherreallyicannotbelieveit
yeaphowmuchiloveyoumydearmother

Sample Output

求两个字符串的最长公共子串长度

用了罗穗骞的模板 - -

#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 222222
using namespace std;
int wa[MAXN],wb[MAXN],wv[MAXN],ws[MAXN];
int sa[MAXN],height[MAXN],ranks[MAXN];
char str[MAXN*2];
int r[MAXN*2];
int cmp(int *q,int a,int b,int l){
    return q[a]==q[b]&&q[a+l]==q[b+l];
}
void da(int n,int m){
    int i,j,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++;
    }
}
void getheight(int n){
    int i,j,k=0;
    for(i=1;i<=n;i++)   ranks[sa[i]]=i;
    for(i=0;i<n;height[ranks[i++]]=k)
    for(k?k--:0,j=sa[ranks[i]-1];r[i+k]==r[j+k];k++);
}
int main(){
    scanf("%s",str);
    int l1=strlen(str);
    str[l1]=1;
    scanf("%s",str+l1+1);
    int l=strlen(str);
    for(int i=0;i<l;i++)
        r[i]=str[i];
    r[l]=0;
    da(l+1,128);
    getheight(l);
    int ans=0;
    for(int i=2;i<=l;i++){
        if(height[i]>ans)
            if((l1<sa[i-1]&&sa[i]<l1)||(l1>sa[i-1]&&sa[i]>l1))
                ans=height[i];

    }
    printf("%d\n",ans);
    return 0;
}