动态规划
文章平均质量分 82
墓菱
这个作者很懒,什么都没留下…
展开
-
Greatest Common Increasing Subsequence(HDOJ-1423)
Problem Description This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.Input Each sequence is described with M - its length (1 <= M <= 500) ...原创 2018-06-10 17:03:16 · 95 阅读 · 0 评论 -
Brackets (POJ-2955)
DescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence, if s is a regular brackets sequence, then (s) and [s] are...原创 2018-06-10 17:06:31 · 305 阅读 · 0 评论 -
FatMouse's Speed(HDOJ-1160)
Problem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as pos...原创 2018-07-10 11:10:42 · 106 阅读 · 0 评论 -
Ingredients(Gym - 101635E)
The chef of a restaurant aspiring for a Michelin star wants to display a selection of her signature dishes for inspectors. For this, she has allocated a maximum budget B for the cumulated cost, and sh...原创 2018-08-22 22:11:12 · 491 阅读 · 0 评论