zoukankan      html  css  js  c++  java
  • 洛谷——P2957 [USACO09OCT]谷仓里的回声Barn Echoes

    https://www.luogu.org/problem/show?pid=2957

    题目描述

    The cows enjoy mooing at the barn because their moos echo back, although sometimes not completely. Bessie, ever the excellent

    secretary, has been recording the exact wording of the moo as it goes out and returns. She is curious as to just how much overlap there is.

    Given two lines of input (letters from the set a..z, total length in the range 1..80), each of which has the wording of a moo on it, determine the greatest number of characters of overlap between one string and the other. A string is an overlap between two other strings if it is a prefix of one string and a suffix of the other string.

    By way of example, consider two moos:

    moyooyoxyzooo

    yzoooqyasdfljkamo

    The last part of the first string overlaps 'yzooo' with the first part of the second string. The last part of the second string

    overlaps 'mo' with the first part of the first string. The largest overlap is 'yzooo' whose length is 5.

    POINTS: 50

    奶牛们非常享受在牛栏中哞叫,因为她们可以听到她们哞声的回音。虽然有时候并不能完全听到完整的回音。Bessie曾经是一个出色的秘书,所以她精确地纪录了所有的哞叫声及其回声。她很好奇到底两个声音的重复部份有多长。

    输入两个字符串(长度为1到80个字母),表示两个哞叫声。你要确定最长的重复部份的长度。两个字符串的重复部份指的是同时是一个字符串的前缀和另一个字符串的后缀的字符串。

    我们通过一个例子来理解题目。考虑下面的两个哞声:

    moyooyoxyzooo

    yzoooqyasdfljkamo

    第一个串的最后的部份"yzooo"跟第二个串的第一部份重复。第二个串的最后的部份"mo"跟第一个串的第一部份重复。所以"yzooo"跟"mo"都是这2个串的重复部份。其中,"yzooo"比较长,所以最长的重复部份的长度就是5。

    输入输出格式

    输入格式:

    • Lines 1..2: Each line has the text of a moo or its echo

    输出格式:

    • Line 1: A single line with a single integer that is the length of the longest overlap between the front of one string and end of the other.

    输入输出样例

    输入样例#1:
    abcxxxxabcxabcd 
    abcdxabcxxxxabcx 
    
    输出样例#1:
    11 
    

    说明

    'abcxxxxabcx' is a prefix of the first string and a suffix of the second string.

    hash处理

     1 #include <algorithm>
     2 #include <cstring>
     3 #include <cstdio>
     4 
     5 using namespace std;
     6 
     7 #define ull unsigned long long
     8 #define p 233
     9 char s1[88],s2[88];
    10 ull l1,l2,hs1[88],hs2[88];
    11 
    12 inline void Get_hash1()
    13 {
    14     for(int i=1;i<=l1;i++)
    15         hs1[i]=hs1[i-1]*p+s1[i]-'a';
    16 }
    17 inline void Get_hash2()
    18 {
    19     for(int i=1;i<=l2;i++)
    20         hs2[i]=hs2[i-1]*p+s2[i]-'a';
    21 }
    22 inline ull Q_pow(ull a,ull b)
    23 {
    24     ull base=a,ret=1;
    25     for(;b;b>>=1,base*=base)
    26         if(b&1) ret*=base;
    27     return ret;
    28 }
    29 inline ull db1(ull x,ull y,ull P) { return hs1[y]-hs1[x-1]*P; }
    30 inline ull db2(ull x,ull y,ull P) { return hs2[y]-hs2[x-1]*P; }
    31 
    32 int main()
    33 {
    34     scanf("%s%s",s1+1,s2+1);
    35     l1=strlen(s1+1); l2=strlen(s2+1);
    36     Get_hash1(); Get_hash2();
    37     int ans=0;
    38     for(int i=1;i<=l1;i++)
    39         if(hs1[i]==db2(l2-i+1,l2,Q_pow(p,i))) ans=max(ans,i);
    40     for(int i=1;i<=l2;i++)
    41         if(hs2[i]==db1(l1-i+1,l1,Q_pow(p,i))) ans=max(ans,i);
    42     printf("%d",ans);
    43     return 0;
    44 }
    ——每当你想要放弃的时候,就想想是为了什么才一路坚持到现在。
  • 相关阅读:
    浅谈SQL优化入门:1、SQL查询语句的执行顺序
    RabbitMQ 第三课 Exchange交换机详解
    RabbitMQ 第二课 快速入门
    RabbitMQ 第一课 RabbitMQ基本概念
    別人的JVM博客总结
    MySQL面试题 数据库MySQL经典面试题之SQL语句
    Swagger介绍及使用
    hcjk_SQL_FinReport_ismealFlag_Version
    hcjk_SQL 退费干掉,组套全展开,但0元被删掉了,退费的打印待沟通
    hcjk_fr 查询SQL,支持组套
  • 原文地址:https://www.cnblogs.com/Shy-key/p/7359218.html
Copyright © 2011-2022 走看看