杭電ACM-LCY算法進階培訓班-專題訓練09

1014 剪花布條

#pragma GCC optimize(2) #pragma GCC optimize(3,"Ofast","inline") #include <bits/stdc++.h> #define inf 0x7fffffff #define ll long long #define int long long //#define double long double //#define double long long #define re register int //#define void inline void #define eps 1e-8 //#define mod 1e9+7 #define ls(p) p<<1 #define rs(p) p<<1|1 #define pi acos(-1.0) #define pb push_back #define mk make_pair #define P pair < int , int > using namespace std; const int mod=1e9+7; const int M=1e8; const int N=1e6+5;//??????.???? 4e8 int n,m; char a[N],b[N]; int nxt[N],f[N]; void init() {nxt[1]=0;for(re i=2,j=0;i<=n;i++){while(j>0&&a[i]!=a[j+1]) j=nxt[j];if(a[i]==a[j+1]) j++;nxt[i]=j;} } int kmp() {int cnt=0;for(re i=1;i<=n;i++) f[i]=0;for(re i=1,j=0;i<=m;i++){while(j>0&&(j==n||b[i]!=a[j+1])) j=nxt[j];if(b[i]==a[j+1]) j++;f[i]=j;if(f[i]==n) cnt++,j=0;}return cnt; } void solve() {while(scanf("%s",b+1)!=EOF){if(b[1]=='#') break;scanf("%s",a+1);m=strlen(b+1);n=strlen(a+1);init();cout<<kmp()<<endl;} } signed main() {int T=1; // cin>>T;for(int index=1;index<=T;index++){solve(); // puts("");}return 0; } /*

1015 Simpsons’ Hidden Talents

#pragma GCC optimize(2) #pragma GCC optimize(3,"Ofast","inline") #include <bits/stdc++.h> #define inf 0x7fffffff #define ll long long #define int long long //#define double long double //#define double long long #define re register int //#define void inline void #define eps 1e-8 //#define mod 1e9+7 #define ls(p) p<<1 #define rs(p) p<<1|1 #define pi acos(-1.0) #define pb push_back #define mk make_pair #define P pair < int , int > using namespace std; const int mod=1e9+7; const int M=1e8; const int N=1e6+5;//??????.???? 4e8 int nxt[N]; void init(char s[]) {nxt[0]=-1;int i=0,j=-1;int n=strlen(s);while(i<n){if(j==-1||s[i]==s[j]) j++,i++,nxt[i]=j;else j=nxt[j];} } void solve() {char s1[N],s2[N];while(scanf("%s%s",s1,s2)!=EOF){int n=strlen(s1);int m=strlen(s2);s1[n]='(';for(re i=0;i<m;i++) s1[i+n+1]=s2[i];n+=m+1;s1[n]='\0';init(s1);if(nxt[n]) {for(re i=0;i<nxt[n];i++) printf("%c",s1[i]);printf(" ");}printf("%lld\n",nxt[n]);} } signed main() {int T=1; // cin>>T;for(int index=1;index<=T;index++){solve(); // puts("");}return 0; } /**/

總結

以上是生活随笔為你收集整理的杭电ACM-LCY算法进阶培训班-专题训练09的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。