【USACO】Censoring(Silver)

最新推荐文章于 2022-03-28 14:01:41 发布

zhouhongkai06

最新推荐文章于 2022-03-28 14:01:41 发布

阅读量549

点赞数 1

分类专栏： KMP

本文链接：https://blog.csdn.net/zhouhongkai06/article/details/79676815

版权

KMP 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种基于KMP算法的变体方法，用于实现文本中特定子串的有效审查与删除。通过不断寻找并移除目标子串直至其不再出现，确保最终文本符合预设的内容审查标准。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述

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

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

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

输入

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 Twill 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 emptyduring the deletion process.

样例输入

whatthemomooofun

moo

样例输出

whatthefun

解题思路：这道题目是KMP的变形。将模版改一下即可。

代码：（请不要直接拷贝哦）

#include <cstdio>
#include <cstring>
char s[1000005],t[1000005],ans[1000005];
int next[1000005],pos[1000005];
int lens,lent,top=0;
using namespace std;
inline void getnext()//KMP的求next数组
{
	next[0]=-1;
	int i=0,j=-1;
	while (i<lent)
	  if ((j==-1)||(t[i]==t[j])) next[++i]=++j;
	    else j=next[j];
}
int main()
{
	scanf("%s",&s);
	scanf("%s",&t);
	lens=strlen(s);
	lent=strlen(t);
	getnext();
	int j=0;
	for (int i=0;i<lens;i++)
	{
		ans[top++]=s[i];//ans数组相当于是一个栈，用来将答案字母一个一个堆起来
		while ((j!=-1)&&(t[j]!=ans[top-1])) j=next[j];//不断地将字串往右挪
		if (t[j]==ans[top-1]) j++;//如果相同，可以比较下一个字符
		if (j==-1) j=0;//如果j还是-1的话，会影响到下面的程序，所以就将它改成0
		pos[top-1]=j;//记录当前这个字符已经匹配到子串的那个字符了
		if (j==lent) //子串是否成功完全匹配
		{//如果成功了
			top-=lent;//栈顶往下放，相当于去掉了这个子串
			j=pos[top-1];//回溯
		}
	}
	for (int i=0;i<top;i++)  putchar(ans[i]);
	printf("\n");
	return 0;
}