随笔分类 -  后缀数组

Common Substrings poj 3415 找次数最多的连续重复子串
只有注册用户登录后才能阅读该文。
posted @ 2014-09-02 14:43 ERKE 阅读(1) 评论(0) 推荐(0)
Distinct Substrings 2 后缀数组
只有注册用户登录后才能阅读该文。
posted @ 2014-08-31 01:58 ERKE 阅读(1) 评论(0) 推荐(0)
Life Forms (poj3294 后缀数组求 不小于k个字符串中的最长子串)
摘要:(累了,这题做了很久!)Life FormsTime Limit:5000MSMemory Limit:65536KTotal Submissions:8683Accepted:2375DescriptionYou may have wondered why most extraterrestrial life forms resemble humans, differing by superficial traits such as height, colour, wrinkles, ears, eyebrows and the like. A few bear no human resem 阅读全文
posted @ 2014-03-13 22:29 ERKE 阅读(230) 评论(0) 推荐(0)
Long Long Message (poj2774 后缀数组求最长公共子串)
摘要:Long Long MessageTime Limit:4000MSMemory Limit:131072KTotal Submissions:19206Accepted:7934Case Time Limit:1000MSDescriptionThe little cat is majoring in physics in the capital of Byterland. A piece of sad news comes to him these days: his mother is getting ill. Being worried about spending so much o 阅读全文
posted @ 2014-03-13 14:16 ERKE 阅读(395) 评论(0) 推荐(0)
687. Repeats spoj (后缀数组 重复次数最多的连续重复子串)
摘要:687. RepeatsProblem code: REPEATSA 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 = abaabaabaabais a (4,3)-repeat with t = aba as its seed string. That is, the seed string t is 3 characters long, and 阅读全文
posted @ 2014-03-13 13:37 ERKE 阅读(263) 评论(0) 推荐(0)
Maximum repetition substring (poj3693 后缀数组求重复次数最多的连续重复子串)
摘要:Maximum repetition substringTime Limit:1000MSMemory Limit:65536KTotal Submissions:6328Accepted:1912DescriptionThe repetition number of a string is defined as the maximum numberRsuch that the string can be partitioned intoRsame consecutive substrings. For example, the repetition number of "ababa 阅读全文
posted @ 2014-03-13 13:21 ERKE 阅读(282) 评论(0) 推荐(0)
1297. Palindrome ural1297(后缀数组)
摘要: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 Unlimited» has infiltrated into “U.S. Robotics”. «U.S. Robots» security service would have alrea 阅读全文
posted @ 2014-03-12 16:30 ERKE 阅读(246) 评论(0) 推荐(0)
705. New Distinct Substrings spoj(后缀数组求所有不同子串)
摘要:705. New Distinct SubstringsProblem code: SUBST1Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. T 2 #include 3 #include 4 using namespace std; 5 #define N 51000 6 char a[N]; 7 int c[N],d[N],e[N],sa[N],height[N],n,b[N],m; 8 int cmp(int *r,in.. 阅读全文
posted @ 2014-03-11 23:55 ERKE 阅读(248) 评论(0) 推荐(0)
Milk Patterns poj3261(后缀数组)
摘要:Milk PatternsTime Limit:5000MSMemory Limit:65536KTotal Submissions:9274Accepted:4173Case Time Limit:2000MSDescriptionFarmer 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 阅读全文
posted @ 2014-03-11 13:57 ERKE 阅读(234) 评论(0) 推荐(0)
Musical Theme poj1743(后缀数组)
摘要:Musical ThemeTime Limit:1000MSMemory Limit:30000KTotal Submissions:16757Accepted:5739DescriptionA musical melody is represented as a sequence of N (1 2 #include 3 #include 4 using namespace std; 5 #define N 20001 6 int a[N],c[N],d[N],e[N],sa[N],height[N],n,b[N],m; 7 int cmp(int *r,int a,int b,int .. 阅读全文
posted @ 2014-03-11 13:50 ERKE 阅读(228) 评论(0) 推荐(0)