黑码

题目1 : 后缀自动机三·重复旋律6 时间限制:15000ms 单点时限:3000ms 内存限制:512MB 描述小Hi平时的一大兴趣爱好就是演奏钢琴。我们知道一个音乐旋律被表示为一段数构成的数列。现在小Hi想知道一部作品中所有长度为K的旋律中出现次数最多的旋律的出现次数。但是K不是固定的，小Hi想知道对于所有的K的答案。解题方法提示输入共一行，包含一个由小写字母构成的字符串S。字符串长度不

题意：给一个字符串S和一系列字符串s1~sn，问在S中有多少个不同子串满足它不是s1~sn中任意一个字符串的子串后缀自动机 对sa建立串，然后找每个串在母串上每个点的最大匹配长度，然后最后从后往前拓扑更新就好，因为叶子的max是能影响父亲的max，最后统计的时候 看Maxi是否有值，一旦有值，必定是这个点上的合法的值，那么就是统计上 Max[p]-Maxi[p] 而且往父节点更新，否则就是Max[p

Little Daniel loves to play with strings! He always finds different ways to have fun with strings! Knowing that, his friend Kinan decided to test his skills so he gave him a string S and asked him Q qu

You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with length x appears in S. For example for string ‘aba

In this problem, you are given several strings that contain only digits from '0' to '9', inclusive. An example is shown below. 101 123 The set S of strings is consists of the N strings given i

A string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the set of lowercase letters.Substring, also called factor, is a consecutive sequence of characters occurre

后缀自动机二 重复旋律五本题要求我们求出一个字符串S中本质不同的子串个数。显然，答案就是所有状态上的子串个数之和，这里说的一个状态上的子串个数，是longest-shortest+1。主要需要学习的是，后缀自动机的O(N)构建方法。需要了解的是，一个状态u的shortest=fail.longest+1。#include <bits/stdc++.h>using namespace std;co

时间限制:15000ms 单点时限:3000ms 内存限制:512MB 描述小Hi平时的一大兴趣爱好就是演奏钢琴。我们知道一段音乐旋律可以被表示为一段数构成的数列。神奇的是小Hi发现了一部名字叫《十进制进行曲大全》的作品集，顾名思义，这部作品集里有许多作品，但是所有的作品有一个共同特征：只用了十个音符，所有的音符都表示成0-9的数字。现在小Hi想知道这部作品中所有不同的旋律的“和”（也就是把串

A string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the set of lowercase letters.Substring, also called factor, is a consecutive sequence of characters occurre

Now you are back,and have a task to do: Given you a string s consist of lower-case English letters only,denote f(s) as the number of distinct sub-string of s. And you have some query,each time you

Common Substrings Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 11519 Accepted: 3814 DescriptionA substring of a string T is defined as:T(i, k)=TiTi+1…Ti+k-1, 1≤i≤i+k-1≤|T|.