00后的博客

直接复制一遍母串，套一个。

HDU - 4847 Wow! Such Doge!#include<iostream>using namespace std;int main(){ string s; int res=0; while(getline(cin,s)) { //if((int)s.size()==0) break;//加上就WA了 for(int i=0;i<(int)s.size();i++) if(s[i]>='A'&&s[i]<='Z')

HDU - 2609 How many（最小表示法）#include<iostream>#include<set>using namespace std;int get_min(string s,int n){ int k=0,i=0,j=1; while(k<n&&i<n&&j<n) { if(s[(i+k)%n]==s[(j+k)%n]) k++; else { if(s[(i+k)%n]&gt

HDU - 3374 String Problem（最大最小表示法，KMP）#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int N = 1000010;char s[N];int ne[N];void get_next(char b[],int m){ for(int i=2,j=0;i<=m;i++) { while(j&

HDU - 2328 Corporate Identity#include<iostream>using namespace std;const int N = 4010;string s[N];int n;bool check(string str){ for(int i=2;i<=n;i++) if(s[i].find(str)==string::npos) return false; return true;}int main(){ while(

HDU - 4300 Clairewd’s message（KMP）#include<cstdio>#include<cstring>const int N = 100010;char s[30],str[N],s1[30],s2[30],b[N<<1];int ne[N<<1];void get_next(int m){ for(int i=2,j=0;i<=m;i++) { while(j&&b[i]!=

POJ - 2185 Milking Grid（KMP）#include<stdio.h>#include<string.h>const int N = 10010, M = 80;char str[N][M];int ne[N],st[M];int main(){ int n,m;scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%s",str[i]); for(int j

HDU - 1867 A + B for you again#include<iostream>#include<cstring> using namespace std;string a,b;const int N = 100010;int p[2*N];int m,n,c;void getnext1(){ memset(p,-1,sizeof p); int j=-1,i=0; while(i<m) { if(j==-1||b[i]==b[j

HDU - 2203 亲和串#include<iostream>#include<cstring> using namespace std;string a,b;const int N = 100010;int p[2*N];int m,n,c;void getnext(){ memset(p,-1,sizeof p); int j=-1,i=0; while(i<m) { if(j==-1||b[i]==b[j]) p[++i]=++j;

HDU - 3068 最长回文#include<iostream>#include<cstring>#include<vector>using namespace std;const int N=1010;int Manacher(string s){ if(s.size() <= 1) return 1; string str = "@#";//一定注意这个@，非常关键，因为在从下标为1的#字符开始求解p数组时没有这个符号就越界了

HDU - 3336 Count the string#include<cstdio>#include<cstring>const int N = 1e6+10;char b[N];int p[N],m;void getnext(){ int i=0,j=-1; memset(p,-1,sizeof p); while(i<m) { if(j==-1||b[i]==b[j]) p[++i]=++j; else j=p[j]; } }int

HDU - 4763 Theme Section#include<cstdio>#include<cstring> const int N = 1e6+10;char b[N];int p[N];int m;void getnext(){ int i=0,j=-1; memset(p,-1,sizeof p); while(i<m) { if(j==-1||b[i]==b[j]) p[++i]=++j; else j=p[j]; }}

HDU - 2594 Simpsons’ Hidden Talents#include<iostream>#include<cstdio>#include<cstring>using namespace std;string b,a;int p[1000010];int m;void getnext(){ int i=0,j=-1; memset(p,-1,sizeof p); while(i<m) { if(j==-1||b[i

HDU - 1686 Oulipo#include<cstdio>#include<cstring>char a[10010],b[1000010];int p[10010];int n,m,c;void getnext(){ int i=0,j=-1; memset(p,-1,sizeof p); while(i<n) { if(j==-1||a[i]==a[j]) p[++i]=++j; else j=p[j]; }}void kmp

HDU - 1358 Period#include<cstdio>#include<cstring>char b[1000010];int p[1000010];int m;void getnext(char *b){ int i=0,j=-1; memset(p,-1,sizeof p); while(i<m) { if(j==-1||b[i]==b[j]) p[++i]=++j; else j=p[j]; }}int main()

POJ - 3080 Blue Jeans#include<iostream>using namespace std;string s[20],str;int main(){ int t,n;cin>>t; while(t--) { string ss="no significant commonalities"; cin>>n; for(int i=1;i<=n;i++) cin>>s[i]; for(int k=3;k

POJ - 2406 Power Strings#include<cstdio>#include<cstring>char a[1000010];int p[1000010];int n,m,c;void getnext(){ int i=0,j=-1; memset(p,-1,sizeof p); while(i<m) { if(j==-1||b[i]==b[j]) p[++i]=++j; else j=p[j]; }}int ma

POJ - 2752 Seek the Name, Seek the Fame找当前串的最大相同前缀后缀，找到一个后，令该相同前缀后缀为当前串，再循环调用，直到循环到P[0]=-1的位置#include<cstdio>#include<cstring> const int N = 400005;char b[N];int p[N],a[N];int m;void getnext(){ int i=0,j=-1; memset(p,-1,sizeof p);

HDU - 3746 Cyclic Nacklace（KMP）#include<cstdio>#include<cstring>char a[1000010];int p[1000010];int n,m,c;void getnext(){ int i=0,j=-1; memset(p,-1,sizeof p); while(i<n) { if(j==-1||a[i]==a[j]) p[++i]=++j; else j=p[j]; }}

HDU -1238 Substrings#include<iostream>#include<algorithm>using namespace std;const int inf=0x3f3f3f3f;string s[110],s1,s2;int n;int judge(){ s2=s1; reverse(s2.begin(),s2.end());//反转 for(int i=1;i<=n;i++)//比对后面的字符串 if(s[i].fin

HDU - 2087 剪花布条#include<cstdio>#include<cstring>char a[10010],b[1000010];int p[10010];int n,m,c;void getnext(){ int i=0,j=-1; memset(p,-1,sizeof p); while(i<n) { if(j==-1||a[i]==a[j]){ i++,j++,p[i]=j; } else j=p[j]; }}

HDU - 1711 Number Sequence#include<cstdio>#include<cstring>char a[1010],b[1010];int p[1010];int n,m,c;void getnext(){ int i=0,j=-1; memset(p,-1,sizeof p); while(i<n) { if(j==-1||a[i]==a[j]){ i++,j++,p[i]=j; } else j=p[j];