晓风微微

摘要： ZS the Coder is coding on a crazy computer. If you don't type in a word for a cconsecutive seconds, everything you typed disappear! More formally, if 阅读全文

摘要： Our geometry princess XMM has stoped her study in computational geometry to concentrate on her newly opened factory. Her factory has introduced M new 阅读全文

摘要： 题意： 不想说 坑点; 初始答案应该设置为一个极小的负数，不能设置为0。 代码: 阅读全文

摘要： 题目： Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had. Marge: Yeah, what is it? Homer: Take me for exampl 阅读全文

摘要： 题目： For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether th 阅读全文

摘要： CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan le 阅读全文

摘要： 题目： It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non 阅读全文

摘要： Clairewd’s message Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7630 Accepted Submission(s): 2 阅读全文

摘要： Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T<=20; Each test case consists of one stri 阅读全文

摘要： 题意：给一个字符串，求它不同的子串的个数 方法：后缀数组，答案是sum(n-sa[i]+height[i]) 代码： 阅读全文