随笔分类 -  处理字符串

Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) D. Dense Subsequence（贪心）
摘要：D. Dense Subsequence D. Dense Subsequence You are given a string s, consisting of lowercase English letters, and the integer m. One should choose some 阅读全文
posted @ 2016-10-09 13:33 MartinEden 阅读(211) 评论(0) 推荐(0)
zstu-2437 English word
摘要：2437: English word Description You still are worried about reading acm English problem, let me tell you a kind of very good method of Memorising Words 阅读全文
posted @ 2016-07-23 10:28 MartinEden 阅读(209) 评论(0) 推荐(0)
hdu-3613 Best Reward (manacher算法)
摘要：Best Reward 题目链接 Best Reward 题目链接 Description After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with 阅读全文
posted @ 2016-07-07 20:59 MartinEden 阅读(257) 评论(0) 推荐(0)
HDU 2609 How many （最大最小表示法）
摘要：How many Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2184 Accepted Submission(s): 904 Problem 阅读全文
posted @ 2016-07-06 21:06 MartinEden 阅读(223) 评论(0) 推荐(0)
HDU 4513 吉哥系列故事――完美队形II （manacher算法）
摘要：吉哥系列故事――完美队形II hdu-4513 Description 吉哥又想出了一个新的完美队形游戏！ 假设有n个人按顺序站在他的面前，他们的身高分别是h[1], h[2] ... h[n]，吉哥希望从中挑出一些人，让这些人形成一个新的队形，新的队形若满足以下三点要求，则就是新的完美队形： 1、 阅读全文
posted @ 2016-07-06 20:58 MartinEden 阅读(351) 评论(0) 推荐(0)