上一页 1 2 3 4 5 6 7 8 ··· 16 下一页
摘要: 一点疑问: 当创建nq节点时,要不要把nq的cnt标记赋值为1? 讲道理nq节点也是代表一个子串啊,不过网上的模板都没赋值。 2017.9.18 update: 把memset部分重写,改成用节点用到时再初始化,初始化所有节点可能被卡。 fa,len,cnt数组其实不用清空,因为用时都赋值了。 阅读全文
posted @ 2017-09-13 17:21 weeping 阅读(771) 评论(0) 推荐(0) 编辑
摘要: 地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6194 题目: string string string Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (J 阅读全文
posted @ 2017-09-11 11:02 weeping 阅读(1069) 评论(0) 推荐(0) 编辑
摘要: 1 struct RMQ 2 { 3 int log2[N],mi[N][25]; 4 void init(int n) 5 { 6 for(int i = 0; i > 1] + 1); 7 for(int j = 1; j < log2[n]; j ++) 8 for(int i = 1; i +... 阅读全文
posted @ 2017-09-11 10:56 weeping 阅读(246) 评论(0) 推荐(0) 编辑
摘要: 题目: C. From Y to Y time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. From Y to Y time li 阅读全文
posted @ 2017-09-01 23:55 weeping 阅读(391) 评论(0) 推荐(0) 编辑
摘要: 题面: B. Tell Your World time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output B. Tell Your World 阅读全文
posted @ 2017-09-01 23:49 weeping 阅读(141) 评论(0) 推荐(0) 编辑
摘要: 地址:http://codeforces.com/contest/842/problem/C 题目: C. Ilya And The Tree time limit per test 2 seconds memory limit per test 256 megabytes input standa 阅读全文
posted @ 2017-08-30 12:01 weeping 阅读(166) 评论(0) 推荐(0) 编辑
摘要: 地址:http://codeforces.com/contest/842/problem/D 题目: D. Vitya and Strange Lesson time limit per test 2 seconds memory limit per test 256 megabytes input 阅读全文
posted @ 2017-08-30 11:54 weeping 阅读(303) 评论(0) 推荐(0) 编辑
摘要: 地址:http://acm.hdu.edu.cn/showproblem.php?pid=4057 题目: Rescue the Rabbit Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Oth 阅读全文
posted @ 2017-08-29 12:42 weeping 阅读(137) 评论(0) 推荐(0) 编辑
摘要: 地址:http://acm.hdu.edu.cn/showproblem.php?pid=2825 题目: Wireless Password Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Other 阅读全文
posted @ 2017-08-29 10:20 weeping 阅读(180) 评论(0) 推荐(0) 编辑
摘要: 地址:http://acm.hdu.edu.cn/showproblem.php?pid=2457 题目: DNA repair Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total 阅读全文
posted @ 2017-08-28 22:58 weeping 阅读(207) 评论(0) 推荐(0) 编辑
摘要: 地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6121 题面: Build a tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Ot 阅读全文
posted @ 2017-08-27 18:01 weeping 阅读(117) 评论(0) 推荐(0) 编辑
摘要: fastIO读入挂: fread读入挂: 阅读全文
posted @ 2017-08-24 14:57 weeping 阅读(171) 评论(0) 推荐(0) 编辑
摘要: 题面: Problem I. Increasing or DecreasingInput file: standard inputOutput file: standard outputTime limit: 2 secondsMemory limit: 512 mebibytesWe all li 阅读全文
posted @ 2017-08-24 00:19 weeping 阅读(159) 评论(0) 推荐(0) 编辑
摘要: 地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6162 题目: Ch’s gift Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) 阅读全文
posted @ 2017-08-23 00:13 weeping 阅读(140) 评论(0) 推荐(0) 编辑
摘要: 地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6166 题目: Senior Pan Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Oth 阅读全文
posted @ 2017-08-22 22:03 weeping 阅读(194) 评论(0) 推荐(0) 编辑
摘要: 地址:http://www.lydsy.com/JudgeOnline/problem.php?id=2818 题目: 2818: Gcd Description 给定整数N,求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对. 给定整数N,求1<=x,y<=N且Gcd(x,y)为 阅读全文
posted @ 2017-08-21 00:48 weeping 阅读(209) 评论(0) 推荐(0) 编辑
摘要: 地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6127 题目: Hard challenge Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/ 阅读全文
posted @ 2017-08-16 11:52 weeping 阅读(170) 评论(0) 推荐(0) 编辑
摘要: 普通版本: 区间更新版本- 启发式合并: 阅读全文
posted @ 2017-08-15 01:50 weeping 阅读(238) 评论(0) 推荐(0) 编辑
摘要: 题目: You are given one string S consisting of only '0' and '1'. You are bored, so you start to play with the string. In each operation, you can move an 阅读全文
posted @ 2017-08-07 22:15 weeping 阅读(296) 评论(0) 推荐(0) 编辑
摘要: 题目:Statements Dreamoon likes algorithm competitions very much. But when he feels crazy because he cannot figure out any solution for any problem in a 阅读全文
posted @ 2017-08-07 22:07 weeping 阅读(339) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 ··· 16 下一页