上一页 1 2 3 4 5 6 7 8 9 10 ··· 29 下一页
摘要: Problem Description刚学完后缀数组求回文串的瑶瑶(tsyao)想到了另一个问题:如果能够对字符串做一些修改,怎么在每次询问时知道以某个字符为中心的最长回文串长度呢?因为瑶瑶整天只知道LOL,当他知道自己省选成绩的时候就天天在LOL,导致现在的她实在是太弱了,根本解决不了这个问题,于... 阅读全文
posted @ 2014-08-07 10:49 Oyking 阅读(316) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionAlice and Bob are playing together. Alice is crazy about art and she has visited many museums around the world. She has a good memo... 阅读全文
posted @ 2014-08-05 20:11 Oyking 阅读(298) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionThere is an old country and the king fell in love with a devil. The devil always asks the king to do some crazy things. Although th... 阅读全文
posted @ 2014-08-05 00:10 Oyking 阅读(405) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionThere is an old country and the king fell in love with a devil. The devil always asks the king to do some crazy things. Although th... 阅读全文
posted @ 2014-08-03 21:13 Oyking 阅读(803) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4900Problem DescriptionThere is an old country and the king fell in love with a devil. The devil always... 阅读全文
posted @ 2014-08-02 22:44 Oyking 阅读(447) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4897Problem DescriptionThere is an old country and the king fell in love with a devil. The devil always... 阅读全文
posted @ 2014-08-02 15:46 Oyking 阅读(404) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2112The Company Dynamic Rankings has developed a new kind of computer that is no lon... 阅读全文
posted @ 2014-08-01 23:50 Oyking 阅读(428) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.timus.ru/problem.aspx?space=1&num=1416Zaphod Beeblebrox — President of the Imperial Galactic Government. And by chance he is an owner ... 阅读全文
posted @ 2014-07-24 14:57 Oyking 阅读(328) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acdream.info/problem?pid=1128Problem Descriptionwuyiqi陷入了一个迷宫中,这个迷宫是由N*M个格子组成的矩阵。每个格子上堆放了一定数量的箱子。(i,j)表示第i行,第j列的格子。wuyiqi可以将一个格子上的箱子移动到相邻的... 阅读全文
posted @ 2014-07-22 16:06 Oyking 阅读(293) 评论(0) 推荐(0) 编辑
摘要: In mathematical terms, the sequenceFnof Fibonacci numbers is defined by the recurrence relationF1 = 1;F2 = 1;Fn = Fn - 1 + Fn - 2(n > 2).DZY loves Fib... 阅读全文
posted @ 2014-07-16 14:46 Oyking 阅读(754) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 29 下一页