随笔分类 -  KMP

摘要:2790: GAUSS 2014 Time Limit: 1000 MS Memory Limit: 65536 KB Total Submit: 12 Accepted: 7 Page View: 20 Submit Status Discuss 2790: GAUSS 2014 Descript 阅读全文
posted @ 2018-04-18 18:44 hinata_hajime 阅读(224) 评论(0) 推荐(0)
摘要:2789: 上决╇ф的战争 Time Limit: 1000 MS Memory Limit: 65536 KB Total Submit: 14 Accepted: 1 Page View: 38 Submit Status Discuss 2789: 上决╇ф的战争 Description 上决 阅读全文
posted @ 2018-04-18 17:27 hinata_hajime 阅读(530) 评论(0) 推荐(0)
摘要:BWT Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 775 Accepted Submission(s): 242 Problem Desc 阅读全文
posted @ 2017-10-03 20:31 hinata_hajime 阅读(261) 评论(0) 推荐(0)
摘要:Bazinga Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4572 Accepted Submission(s): 1459 Problem 阅读全文
posted @ 2017-09-05 22:02 hinata_hajime 阅读(91) 评论(0) 推荐(0)
摘要:Sequence I Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2330 Accepted Submission(s): 874 Probl 阅读全文
posted @ 2017-09-04 23:35 hinata_hajime 阅读(158) 评论(0) 推荐(0)
摘要:突然有一天默默无闻的QAQ变成了FJUTOJ的终极大BOSS,而使得QAQ变强的是QAQ掌握有一个由小写字母组成魔咒。 作为QAQ小弟的V_Dragon偷偷的听到了一部分连续魔咒,V_Dragon非常的激动,因为这一部分魔咒能使得菜鸡V_Dragon 变强100倍。但V_Dragon的听力不是很好, 阅读全文
posted @ 2017-08-29 11:26 hinata_hajime 阅读(216) 评论(0) 推荐(0)
摘要:A + B for you again Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7978 Accepted Submission(s): 阅读全文
posted @ 2017-08-29 11:17 hinata_hajime 阅读(244) 评论(0) 推荐(0)
摘要: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-emp 阅读全文
posted @ 2017-08-26 21:07 hinata_hajime 阅读(134) 评论(0) 推荐(0)
摘要:Every morning when they are milked, the Farmer John's cows form a rectangular grid that is R (1 <= R <= 10,000) rows by C (1 <= C <= 75) columns. As w 阅读全文
posted @ 2017-08-26 20:06 hinata_hajime 阅读(164) 评论(0) 推荐(0)
摘要:感谢 kuangbin大神 http://www.cnblogs.com/kuangbin/archive/2012/08/14/2638803.html 转一下模板 方便自己查阅 该算法时间复杂度是O(m+n), 得到Next数组的过程是O(n) /*pku3461(Oulipo), hdu171 阅读全文
posted @ 2017-08-21 15:42 hinata_hajime 阅读(219) 评论(0) 推荐(0)
摘要:Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concate 阅读全文
posted @ 2017-08-16 17:05 hinata_hajime 阅读(123) 评论(0) 推荐(0)