codeforces 126 B. Password

题目链接:

huangjing

思路:灵活运用kmp的next值,首先求kmp的next值,首先如果长度小于3那么肯定是不符合条件的,然后对2——len进行标记,然后求next[len+1],然后知道这个值出现过,说明中中间必然出现了前缀,那么就至少出现了3次了。。

题目:

B. Password
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.

A little later they found a string s, carved on a rock below the temple's gates. Asterix supposed that that's the password that opens the temple and read the string aloud. However, nothing happened. Then Asterix supposed that a password is some substring t of the strings.

Prefix supposed that the substring t is the beginning of the string s; Suffix supposed that the substring t should be the end of the string s; and Obelix supposed that t should be located somewhere inside the string s, that is, t is neither its beginning, nor its end.

Asterix chose the substring t so as to please all his companions. Besides, from all acceptable variants Asterix chose the longest one (as Asterix loves long strings). When Asterix read the substring t aloud, the temple doors opened.

You know the string s. Find the substring t or determine that such substring does not exist and all that's been written above is just a nice legend.

Input

You are given the string s whose length can vary from 1 to 106 (inclusive), consisting of small Latin letters.

Output

Print the string t. If a suitable t string does not exist, then print "Just a legend" without the quotes.

Sample test(s)
input
fixprefixsuffix
output
fix
input
abcdabc
output
Just a legend

代码:

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#include<cmath>
#include<string>
#include<queue>
#define eps 1e-9
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;

const int maxn=1000000+10;

char p[maxn];

int m,vis[maxn],next[maxn];

void Getnext()
{
   int j,k;
   next[1]=0;
   k=0;
   j=1;
   while(j<=m)
   {
       if(k==0||p[k]==p[j])
       {
           k++;
           j++;
           next[j]=k;
       }
       else
           k=next[k];
   }
}



int main()
{
    int k,ans,i;
    while(~scanf("%s",p+1))
    {
        m=strlen(p+1);
        Getnext();
        if(m<3)  
        {
            printf("Just a legend\n");
            continue;
        }
        memset(vis,false,sizeof(vis));
        for(i=2;i<=m;i++)
            vis[next[i]]=true;
        i=next[m+1];
        while(!vis[i]&&i)  i=next[i];
        if(i==1)   printf("Just a legend\n");
        else
        {
            for(int j=1;j<i;j++)
                printf("%c",p[j]);
            printf("\n");
        }
    }
    return 0;
}
/*
fixafixbfix
ababacaba
acaba
qwertyqwertyqwerty
*/


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值