acvay

导航

2014年8月7日 #

POJ 3356 AGTC（最长公共子序列）

摘要： AGTCDescriptionLetxandybe two strings over some finite alphabetA. We would like to transformxintoyallowing only operations given below:Deletion:a lett... 阅读全文

posted @ 2014-08-07 21:33 知足o 阅读(116) 评论(0) 推荐(0) 编辑

POJ 3292 Semi-prime H-numbers（数）

摘要： Semi-prime H-numbersDescriptionThis problem is based on an exercise of David Hilbert, who pedagogically suggested that one study the theory of4n+1numb... 阅读全文

posted @ 2014-08-07 21:24 知足o 阅读(116) 评论(0) 推荐(0) 编辑

HDU 1003 Max Sum(dp，最大连续子序列和)

摘要： Max SumProblem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,... 阅读全文

posted @ 2014-08-07 10:06 知足o 阅读(161) 评论(0) 推荐(0) 编辑