【KMP】Censoring

【KMP】Censoring

题目描述

Farmer John has purchased a subscription to Good Hooveskeeping magazine for his cows, so they have plenty of material to read while waiting around in the barn during milking sessions. Unfortunately, the latest issue contains a rather inappropriate article on how to cook the perfect steak, which FJ would rather his cows not see (clearly, the magazine is in need of better editorial oversight).

FJ has taken all of the text from the magazine to create the string S of length at most 10^6 characters. From this, he would like to remove occurrences of a substring T to censor the inappropriate content. To do this, Farmer John finds the _first_ occurrence of T in S and deletes it. He then repeats the process again, deleting the first occurrence of T again, continuing until there are no more occurrences of T in S. Note that the deletion of one occurrence might create a new occurrence of T that didn't exist before.

Please help FJ determine the final contents of S after censoring is complete.

 

输入

The first line will contain S. The second line will contain T. The length of T will be at most that of S, and all characters of S and T will be lower-case alphabet characters (in the range a..z). 

 

输出

The string S after all deletions are complete. It is guaranteed that S will not become empty during the deletion process. 

 

样例输入

whatthemomooofun
moo

样例输出

whatthefun

 

参考博客：

Censoring（栈+KMP）

 

---

 

 

【题解】：

　　正常匹配，不过是加了一个栈来维护。

 

【代码】：

 1 #include<cstdio>
 2 #include<cstring>
 3 using namespace std;
 4 const int N = 1e6 + 10 ;
 5 char s[N],p[N],ans[N];
 6 int n,m,top,Next[N],f[N];
 7  
 8 void get_Next(){
 9     for(int i=2,j=0 ; i<=m ; i++ ){
10         while ( j && p[i] != p[j+1] ) j = Next[j] ;
11         if( p[i] == p[j+1] ) j++;
12         Next[i] = j ;
13     }
14 }
15 void Kmp(){
16  
17     //if( !(m == 1 && s[1] == p[1]) )
18         //ans[++top] = s[1];
19     for(int i=1,j=0 ; i<=n ; i++){
20         ans[++top] = s[i] ;
21         while ( j && ( j==m || s[i] != p[j+1]) ) j = Next[j] ;
22         if ( s[i] == p[j+1] ) j++ ;
23  
24         f[top] = j ;
25         if( j == m ){
26             top = top - m ;
27             j = f[top];
28         }
29     }
30     ans[++top] = '\0';
31     printf("%s\n",ans+1);
32 }
33 int main()
34 {
35     scanf("%s%s",s+1,p+1);
36     n = strlen ( s+1 ) ;
37     m = strlen ( p+1 ) ;
38  
39     get_Next();
40     Kmp();
41     return 0;
42 }
43 /*
44 whatthemomooofun
45 moo
46  */

View Code

 

转载于:https://www.cnblogs.com/Osea/p/11333603.html