B. Password
题意:求字符串中既是前缀又是后缀还在中间出现过的子串
思路:利用Z函数完成前后缀的匹配,同时在这个匹配成功的时候需要有前面有过z[i]可以覆盖到这段的说明中间也出现过。
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 lll;
typedef long double ld;
//#define endl '\n'
#define pii pair<int, int>
const int N = 1e6+8;
const int M = 1e2 + 5;
const ll mod = 1e8+1;
const int inf = 0x3f3f3f3f;
const ll inff = 1e18;
mt19937 rnd(593);
int z[N];
string a;
void kmp(){
int l,r;
l=r=0;
int len=a.length();
for(int i=1;i<len;i++){
//cout<<i<<endl;
if(i<=r){
z[i]=min(z[i-l],r-i+1);
}
while(i+z[i]<len&&a[z[i]]==a[i+z[i]]){
//cout<<"Z: "<<a[i]<<endl;
z[i]++;
}
if(r<i+z[i]-1){
l=i;
r=i+z[i]-1;
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>a;
kmp();
//cout<<"1"<<endl;
int len=a.length();
int maxn=-10;
int flag=0;
for(int i=1;i<len;i++){
if(z[i]+i==len&&maxn>=len-i){
flag=i;
break;
}
maxn=max(maxn,z[i]);
}
// for(int i=0;i<len;i++){
// cout<<z[i]<<" ";
// }
// cout<<endl;
if(!flag) cout<<"Just a legend"<<endl;
else{
for(int i=0;i<=len-flag-1;i++){
cout<<a[i];
}
cout<<endl;
}
return 0;
}
D. Prefixes and Suffixes
题目链接:Problem - 432D - Codeforces
题意:统计既是前缀又是后缀的子串在整个字符串的出现次数,按长度降序输出
思路:构造一个s+‘|’+s的字符串,然后利用z函数可以看出后缀与前缀的关系,然后长的后缀可以后缀和中统计到短的后缀里面,因为短的后缀会出现在匹配成功的长的后缀的里面。
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 lll;
typedef long double ld;
//#define endl '\n'
#define pii pair<int, int>
const int N = 1e6+8;
const int M = 1e2 + 5;
const ll mod = 1e8+1;
const int inf = 0x3f3f3f3f;
const ll inff = 1e18;
mt19937 rnd(593);
int z[N];
string a;
void kmp(){
int l,r;
l=r=0;
int len=a.length();
for(int i=1;i<len;i++){
//cout<<i<<endl;
if(i<=r){
z[i]=min(z[i-l],r-i+1);
}
while(i+z[i]<len&&a[z[i]]==a[i+z[i]]){
//cout<<"Z: "<<a[i]<<endl;
z[i]++;
}
if(r<i+z[i]-1){
l=i;
r=i+z[i]-1;
}
}
}
int book[N],suf[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>a;
int n=a.length();
a=a+'|'+a;
kmp();
//cout<<"1"<<endl;
vector<int> ans;
int cnt=0;
for(int i=n+1;i<=a.length()-1;i++){
//cout<<a[i]<<" "<<z[i]<<endl;
if(z[i]==a.length()-i){
//cout<<"yes"<<endl;
ans.push_back(a.length()-i);
cnt++;
}
book[z[i]]++;
}
reverse(ans.begin(),ans.end());
for(int i=n;i>=1;i--){
suf[i]=suf[i+1]+book[i];
}
cout<<cnt<<endl;
for(auto it:ans){
cout<<it<<" "<<suf[it]<<endl;
}
return 0;
}