随笔分类 -  字符串-其他

摘要:地址:http://acm.hdu.edu.cn/showproblem.php?pid=4763 题目: Theme Section Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)To 阅读全文
posted @ 2017-03-09 21:46 weeping 阅读(143) 评论(0) 推荐(0)
摘要:地址:http://poj.org/problem?id=2778 题目: DNA Sequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15453 Accepted: 5964 Description It's we 阅读全文
posted @ 2016-10-11 18:34 weeping 阅读(326) 评论(0) 推荐(0)
摘要:题目地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=3065 题目: 病毒侵袭持续中 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) 阅读全文
posted @ 2016-10-09 18:09 weeping 阅读(283) 评论(0) 推荐(0)
摘要:地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=2222 题目: Keywords Search Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java 阅读全文
posted @ 2016-10-07 23:36 weeping 阅读(250) 评论(0) 推荐(0)
摘要:地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=2896 题目: 病毒侵袭 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total 阅读全文
posted @ 2016-10-07 23:31 weeping 阅读(260) 评论(0) 推荐(0)
摘要:地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=1251 题目: 统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Tota 阅读全文
posted @ 2016-10-05 16:13 weeping 阅读(207) 评论(0) 推荐(0)
摘要:地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=1247 题目: Hat’s Words Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Other 阅读全文
posted @ 2016-10-05 15:37 weeping 阅读(179) 评论(0) 推荐(0)
摘要:unsigned int BKDRHash(char*str) { unsigned int seed=131 ;// 31 131 1313 13131 131313 etc.. unsigned int hash=0 ; while(*str) { hash=hash*seed+(*str+... 阅读全文
posted @ 2016-08-10 20:54 weeping 阅读(1037) 评论(0) 推荐(0)
摘要:后缀数组 DA(倍增)算法求 SA[N] 与 Rank[N] (时间O(NlogN),空间O(N)) sa[i] : 表示 排在第i位的后缀 起始下标 rank[i] : 表示后缀 suffix(i)排在第几 height[i] : 表示 sa[i-1] 与 sa[i] 的LCP 值 h[i]: 表 阅读全文
posted @ 2016-08-07 21:51 weeping 阅读(1362) 评论(0) 推荐(0)
摘要:1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 #include 12 #include 13 #include 14 #include 15 #include 16 #... 阅读全文
posted @ 2016-07-11 12:07 weeping 阅读(430) 评论(0) 推荐(0)
摘要:地址:http://acm.hdu.edu.cn/showproblem.php?pid=1020 题目: Problem Description Given a string containing only 'A' - 'Z', we could encode it using the follo 阅读全文
posted @ 2016-04-04 13:34 weeping 阅读(245) 评论(0) 推荐(0)