zoukankan      html  css  js  c++  java
  • bzoj3942——2016——3——15

    题目大意:

    3942: [Usaco2015 Feb]Censoring

    Time Limit: 10 Sec  Memory Limit: 128 MB
    Submit: 220  Solved: 115
    [Submit][Status][Discuss]

    Description

    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

    有一个S串和一个T串,长度均小于1,000,000,设当前串为U串,然后从前往后枚举S串一个字符一个字符往U串里添加,若U串后缀为T,则去掉这个后缀继续流程。

    
    
    

    Input

    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).
     

    Output

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

    
    
    

    Sample Input

    whatthemomooofun
    moo

    Sample Output

    whatthefun
    题解:KMP算法,做的时候用一个堆记录一下就可以了。
     1 #include<cstring>
     2 #include<cstdio>
     3 #include<cstring>
     4 char t[1000100],s[1000100];
     5 int m,n,top,i,fix;
     6 int z[1000100],next[1000010],f[1000010];
     7 using namespace std;
     8 int main()
     9 {
    10     scanf("%s%s",s+1,t+1);
    11     m=strlen(s+1); n=strlen(t+1);
    12     for (fix=0,i=2; i<=n; i++)
    13     {
    14         while (fix && t[fix+1]!=t[i]) fix=next[fix];
    15         if (t[fix+1]==t[i]) fix++;
    16         next[i]=fix;
    17     }
    18     for (int i=1; i<=m; i++)
    19     {
    20         fix=f[z[top]];
    21         while (fix && t[fix+1]!=s[i]) fix=next[fix];
    22         if (t[fix+1]==s[i]) fix++;
    23         
    24         if (fix==n) top-=(n-1);
    25             else
    26         f[i]=fix, z[++top]=i;
    27     } 
    28     for (int i=1; i<=top; i++) printf("%c",s[z[i]]);
    29 }
    View Code
    我太蒟蒻了,所以神犇们留下意见让我跪膜
  • 相关阅读:
    Spark&Hadoop:scala编写spark任务jar包,运行无法识别main函数,怎么办?
    Linux:krb5
    SqlServer数据库端口默认是1433吗?
    Linux下使用shell实现上传linux下某个目录下所有文件到ftp
    Spark+Hadoop+Hive集群上数据操作记录
    hadoop之 Hadoop2.2.0中HDFS的高可用性实现原理
    虚拟路由冗余协议VRRP
    hadoop 之Hadoop生态系统
    Oracle NoLogging Append 方式减少批量insert的redo_size
    Oracle常用的性能诊断语句
  • 原文地址:https://www.cnblogs.com/HQHQ/p/5280436.html
Copyright © 2011-2022 走看看