
后缀数组
Jogging_Clown
丢掉盔甲,我依然是骄傲帅气的骑士。
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
URAL 题目1297. Palindrome(后缀数组+RMQ求最长回文子串)
1297. PalindromeTime limit: 1.0 secondMemory limit: 64 MBThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Unli原创 2015-08-24 12:27:00 · 903 阅读 · 0 评论 -
POJ题目3229 Facer’s string(后缀数组求a串长度为k子串有几个出现在b串)
Facer’s stringTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 1879 Accepted: 568DescriptionMinifacer was very happy these days because he has learned原创 2015-08-29 18:34:12 · 788 阅读 · 0 评论 -
HDOJ4029 不同子矩阵的个数
Distinct Sub-matrixTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 165768/165768 K (Java/Others)Total Submission(s): 830 Accepted Submission(s): 249Problem DescriptionIn th转载 2015-08-29 19:10:52 · 608 阅读 · 0 评论 -
POJ 题目3623 Best Cow Line, Gold(后缀数组rank简单应用)
Best Cow Line, GoldTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5063 Accepted: 1806DescriptionFJ is about to take his N (1 ≤ N ≤ 30,000) cows to th原创 2015-08-29 10:52:07 · 955 阅读 · 0 评论 -
POJ 题目1743 Musical Theme(后缀数组,求一个串中最长不重叠重复子串)
Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 21826 Accepted: 7467DescriptionA musical melody is represented as a sequence of N (1<=N<=2000原创 2015-08-18 12:22:44 · 638 阅读 · 0 评论 -
POJ 题目2774 Long Long Message(后缀数组,求最长公共子串长度)
Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 23696 Accepted: 9705Case Time Limit: 1000MSDescriptionThe little cat is majoring i原创 2015-08-18 17:43:27 · 758 阅读 · 0 评论 -
POJ 题目3261 Milk Patterns(后缀数组求最长重叠至少k次的子串长度)
Milk PatternsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 12128 Accepted: 5387Case Time Limit: 2000MSDescriptionFarmer John has noticed that th原创 2015-08-18 18:36:58 · 703 阅读 · 0 评论 -
HDOJ 题目3518 Boring counting(后缀数组,求不重叠重复次数最少为2的子串种类数)
Boring countingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2253 Accepted Submission(s): 924Problem Description035 now fac原创 2015-08-19 01:17:52 · 1021 阅读 · 1 评论 -
SPOJ 题目694 Distinct Substrings(后缀数组,求不同的子串个数)
DISUBSTR - Distinct Substringsno tags Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach test case consists of one st原创 2015-08-18 22:01:07 · 925 阅读 · 0 评论 -
SPOJ 题目705 New Distinct Substrings(后缀数组,求不同的子串个数)
SUBST1 - New Distinct Substringsno tags Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TOutputFor each test case ou原创 2015-08-21 18:58:12 · 1083 阅读 · 0 评论 -
URAL 题目1517. Freedom of Choice(后缀数组,求公共最长串)
1517. Freedom of ChoiceTime limit: 2.0 secondMemory limit: 64 MBBackgroundBefore Albanian people could bear with the freedom of speech (this story is fully described in the problem "Free原创 2015-08-21 18:13:41 · 635 阅读 · 0 评论 -
HDOJ 题目4691 Front compression(后缀数组+RMQ最长前缀)
Front compressionTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 1652 Accepted Submission(s): 604Problem DescriptionFront c原创 2015-08-29 12:34:45 · 724 阅读 · 0 评论 -
HDOJ 题目4416 Good Article Good sentence(后缀数组求a串子串在b串中不出现的种类数)
—每周六晚的BestCoder(有米!)Good Article Good sentenceTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2784 Accepted Submission(s): 78原创 2015-08-29 14:40:29 · 973 阅读 · 0 评论 -
POJ 题目3581 Sequence(后缀数组+离散化)
SequenceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5738 Accepted: 1227Case Time Limit: 2000MSDescriptionGiven a sequence, {A1, A2, ..., An}原创 2015-08-28 18:59:32 · 647 阅读 · 0 评论 -
POJ 题目3294Life Forms(后缀数组求超过k个的串的最长公共子串)
Life FormsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 11178 Accepted: 3085DescriptionYou may have wondered why most extraterrestrial life forms rese原创 2015-08-26 17:09:13 · 682 阅读 · 0 评论 -
POJ 题目3415 Common Substrings(后缀数组+栈,求可以匹配到的长度大于k的公共子串个数)
Common SubstringsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8471 Accepted: 2798DescriptionA substring of a string T is defined as:T(i, k)=TiTi+原创 2015-08-25 19:25:28 · 755 阅读 · 0 评论 -
UVA 题目11512 - GATTACA(后缀数组求出现次数最多的子串及重复次数)
The Institute of Bioinformatics and Medicine (IBM) of your country has been studying the DNAsequences of several organisms, including the human one. Before analyzing the DNA of an organism,the inv原创 2015-08-26 19:04:30 · 1472 阅读 · 0 评论 -
SPOJ题目687 Repeats(后缀数组+RMQ求重复次数最多的子串的重复次数)
REPEATS - Repeatsno tags A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For example, the strings = abaabaabaaba原创 2015-08-26 11:12:03 · 776 阅读 · 0 评论 -
POJ 题目 3693 Maximum repetition substring(后缀数组+RMQ+枚举求最小字典序的重复次数最多的子串)
Maximum repetition substringTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8067 Accepted: 2463DescriptionThe repetition number of a string is defined原创 2015-08-26 12:14:03 · 777 阅读 · 0 评论 -
BZOJ 题目3172: [Tjoi2013]单词(AC自动机||AC自动机+fail树||后缀数组暴力||后缀数组+RMQ+二分等五种姿势水过)
3172: [Tjoi2013]单词Time Limit: 10 Sec Memory Limit: 512 MBSubmit: 1890 Solved: 877[Submit][Status][Discuss]Description某人读论文,一篇论文是由许多单词组成。但他发现一个单词会在论文中出现很多次,现在想知道每个单词分别在论文中出现多少次。Input原创 2015-08-27 16:40:11 · 1053 阅读 · 0 评论 -
FOJ 题目 2075 Substring (后缀数组求出现k次的最小字典序子串)
Problem 2075 Substring Accept: 70 Submit: 236Time Limit: 1000 mSec Memory Limit : 65536 KB Problem DescriptionGiven a string, find a substring of it which the original string conta原创 2015-08-27 21:46:22 · 12719 阅读 · 2 评论 -
BZOJ 题目1031: [JSOI2007]字符加密Cipher(后缀数组sa简单应用)
1031: [JSOI2007]字符加密CipherTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 4318 Solved: 1760[Submit][Status][Discuss]Description喜欢钻研问题的JS 同学,最近又迷上了对加密方法的思考。一天,他突然想出了一种他认为是终极的加密办法:把需要加密的信息排原创 2015-08-27 09:11:07 · 699 阅读 · 0 评论 -
UVA 题目760 DNA Sequencing (后缀数组求两个串最长公共子串,字典序输出)
DNA Sequencing A DNA molecule consists of two strands that wrap around each other to resemble a twisted ladder whose sides, made of sugar and phosphate molecules, are connected by rungs of原创 2015-08-26 23:54:08 · 1082 阅读 · 0 评论 -
UVA 题目1223 - Editor(后缀数组求出现次数超过两次的最长子串的长度)
Mr. Kim is a professional programmer. Recently he wants to design a new editor which has as many functions as possible. Most editors support a simple search function that finds one occurrence (or all原创 2015-08-27 00:16:03 · 1922 阅读 · 0 评论 -
HDOJ 题目5442 Favorite Donut(后缀数组)
Favorite DonutTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2138 Accepted Submission(s): 518Problem DescriptionLulu has a原创 2015-10-02 01:26:09 · 444 阅读 · 0 评论