Joeferyの博客

Description给定两个字符串s和t，现有一个扫描器，从s的最左边开始向右扫描，每次扫描到一个t就把这一段删除，输出能发现t的个数。Input第一行包含一个整数T（T每组数据第一行包含一个字符串s，第二行一个字符串t，字符串长度不超过1000000。Output对于每组数据，输出答案。

DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:Tout avait Pair n

推荐一个学习的地方 点击打开链接#include#include#include#include #include using namespace std;int Next[15000];char s[100],p[100]; //s是字符串,a是模式串int n,m; //n是s的长度,m是p的长度void getNext(int m){ //得到

/*    之前一直用倍增法,发现有些题目卡倍增法，而DC3却能AC,所以顺便弄了    DC3的模版,看以后会不会用到,嗯,就是酱紫    提一些注意点：1.MAXN开n的十倍大小;                  2.dc3(r,sa,n+1,Max+1);r为待后缀处理的数组,sa为存储排名位置的数组,n+1和Max+1 都和倍增一样

DescriptionThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Unlimited» has infiltrated into “U.S. Robotics”. «U.S. R

DescriptionGiven a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach test case consists of one string, whose length is OutputFor e

DescriptionFarmer John has noticed that the quality of milk given by his cows varies from day to day. On further investigation, he discovered that although he can't predict the quality of mi

DescriptionA musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1..88, each representing a key on the piano. It is unfortunate but true that this re