acvay

导航

2014年8月9日 #

HDU 1087 Super Jumping! Jumping! Jumping!(DP)

摘要: Super Jumping! Jumping! Jumping!Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Ma... 阅读全文

posted @ 2014-08-09 19:24 知足o 阅读(120) 评论(0) 推荐(0) 编辑

HDU 2602 Bone Collector(01背包)

摘要: Bone CollectorProblem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies... 阅读全文

posted @ 2014-08-09 16:53 知足o 阅读(106) 评论(0) 推荐(0) 编辑

POJ 3080 Blue Jeans(KMP 最长公共子串)

摘要: Blue JeansDescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hund... 阅读全文

posted @ 2014-08-09 16:41 知足o 阅读(114) 评论(0) 推荐(0) 编辑

2014年8月8日 #

POJ 3993 Not So Flat After All(质因数)

摘要: Not So Flat After AllDescriptionAny positive integer v can be written as p1a1*p2a2*...*pnanwhere piis a prime number and ai ≥ 0. For example: 24 = 23*... 阅读全文

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

POJ 3934 Queue(DP)

摘要: QueueDescriptionLinda is a teacher in ACM kindergarten. She is in charge of n kids. Because the dinning hall is a little bit far away from the classro... 阅读全文

posted @ 2014-08-08 09:31 知足o 阅读(121) 评论(0) 推荐(0) 编辑

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) 编辑

2014年8月6日 #

UVa 12657 Boxes in a Line(双向链表的应用)

摘要: Boxes in a LineYou have n boxes in a line on the table numbered 1 . . . n from left to right. Your task is to simulate 4kinds of commands:• 1 X Y : mo... 阅读全文

posted @ 2014-08-06 21:14 知足o 阅读(214) 评论(0) 推荐(0) 编辑

UVa 679 Dropping Balls

摘要: Dropping BallsA number ofKballs are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visi... 阅读全文

posted @ 2014-08-06 14:51 知足o 阅读(148) 评论(0) 推荐(0) 编辑