05 2016 档案

poj3580 SuperMemo (Splay+区间内向一个方向移动)
摘要：Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 13550 Accepted: 4248Case Time Limit: 2000MSDescriptionYour friend, Jackson i... 阅读全文
posted @ 2016-05-19 22:02 Herumw 阅读(172) 评论(0) 推荐(0) 编辑
bzoj1500: [NOI2005]维修数列 (Splay+变态题)
摘要：Time Limit: 10 Sec Memory Limit: 64 MBSubmit: 11353 Solved: 3553[Submit][Status][Discuss]DescriptionInput输入的第1 行包含两个数N 和M(M ≤20 000)... 阅读全文
posted @ 2016-05-18 16:29 Herumw 阅读(125) 评论(0) 推荐(0) 编辑
hdu3436 Queue-jumpers(Splay)
摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3411 Accepted Submission(s)... 阅读全文
posted @ 2016-05-17 14:35 Herumw 阅读(188) 评论(0) 推荐(0) 编辑
hdu4710 Balls Rearrangement(数学公式+取模)
摘要：Balls RearrangementTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 945 Acce... 阅读全文
posted @ 2016-05-15 19:25 Herumw 阅读(174) 评论(0) 推荐(0) 编辑
hdu1890 Robotic Sort (splay+区间翻转单点更新)
摘要：Problem DescriptionSomewhere deep in the Czech Technical University buildings, there are laboratories for examining mechanical and ele... 阅读全文
posted @ 2016-05-13 11:39 Herumw 阅读(138) 评论(0) 推荐(0) 编辑
zoj2112 Dynamic Rankings （主席树 || 树套树）
摘要：The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply find the k... 阅读全文
posted @ 2016-05-05 20:53 Herumw 阅读(189) 评论(0) 推荐(0) 编辑
poj3581 Sequence (后缀数组)
摘要：Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6305 Accepted: 1364Case Time Limit: 2000MSDescriptionGiven a sequence, {A1, ... 阅读全文
posted @ 2016-05-02 20:46 Herumw 阅读(185) 评论(0) 推荐(0) 编辑
UVA 11475 Extend to Palindrome (kmp || manacher || 后缀数组)
摘要：题目链接：点击打开链接题意：给你一个串，让你在串后面添加尽可能少的字符使得这个串变成回文串。思路：这题可以kmp,manacher,后缀数组三种方法都可以做，kmp和manacher效率较高，时间复杂度是O(n)，后缀数组时间复杂度是O(nlogn).思路是求出元串的... 阅读全文
posted @ 2016-05-01 15:53 Herumw 阅读(140) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示