06 2018 档案

摘要:B. Light It Uptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, you bough... 阅读全文
posted @ 2018-06-28 22:59 StarHai 阅读(388) 评论(0) 推荐(0)
摘要:A. Codehorses T-shirtstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputCodehorses... 阅读全文
posted @ 2018-06-28 22:57 StarHai 阅读(3371) 评论(0) 推荐(0)
摘要:F. Cards and Joytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are nn pla... 阅读全文
posted @ 2018-06-28 19:22 StarHai 阅读(345) 评论(0) 推荐(0)
摘要:E. Reachability from the Capitaltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output... 阅读全文
posted @ 2018-06-28 19:16 StarHai 阅读(389) 评论(0) 推荐(0)
摘要:D. Equalize the Remainderstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou ar... 阅读全文
posted @ 2018-06-28 19:07 StarHai 阅读(435) 评论(0) 推荐(0)
摘要:C. Alphabetic Removalstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are gi... 阅读全文
posted @ 2018-06-28 19:00 StarHai 阅读(290) 评论(0) 推荐(0)
摘要:time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA string ss of length nn can be e... 阅读全文
posted @ 2018-06-28 18:57 StarHai 阅读(330) 评论(0) 推荐(0)
摘要:A. Mishka and Contesttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMishka start... 阅读全文
posted @ 2018-06-28 18:55 StarHai 阅读(326) 评论(0) 推荐(0)
摘要:Mishka started participating in a programming contest. There are nn problems in the contest. Mishka's problem-solving skill is equal t... 阅读全文
posted @ 2018-06-27 16:11 StarHai 阅读(453) 评论(0) 推荐(0)
摘要:Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16473 Accepted: 8678DescriptionFarmer John has purchased a lush n... 阅读全文
posted @ 2018-06-18 21:07 StarHai 阅读(153) 评论(0) 推荐(0)
摘要:拓展kmp是对KMP算法的扩展,它解决如下问题:定义母串S,和字串T,设S的长度为n,T的长度为m,求T与S的每一个后缀的最长公共前缀,也就是说,设extend数组,extend[i]表示T与S[i,n-1]的最长公共前缀,要求出所有extend[i](0=P如下图:... 阅读全文
posted @ 2018-06-07 00:49 StarHai 阅读(354) 评论(0) 推荐(1)