DP动态规划
文章平均质量分 54
fsz-blog
这个作者很懒,什么都没留下…
展开
-
诸侯安置DP做法
这几天考试,在考试中有这样一道题叫“诸侯安置”没过,但事后改对了。题目:诸侯安置【问题描述】很久以前,有一个强大的帝国,它的国土成正方形状,如图1 所示这个国家有若干诸侯。由于这些诸侯都曾立下赫赫战功,国王准备给他们每人一块封地(正方形中的一格)。但是,这些诸侯又非常好战,当两个诸侯位于同一行或同一列时,他们就会开战。如下图2 为n=3 时的国土,阴影部分表原创 2016-07-27 15:27:18 · 846 阅读 · 0 评论 -
Choosing Capital for Treeland (树型DP)
Choosing Capital for TreelandThe country Treeland consists of n cities, some pairs of them are connected with unidirectional roads. Overall there are n - 1 roads in the country. We know that if we don'原创 2017-06-13 16:14:28 · 605 阅读 · 0 评论 -
Godfather
GodfatherLast years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arrest the mafia leaders.Unfortunately, the str原创 2017-06-12 10:48:49 · 358 阅读 · 0 评论 -
Balancing Act
Balancing ActConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the原创 2017-06-12 08:50:10 · 977 阅读 · 0 评论 -
Park Visit(树型DP)
Park Visit Claire and her little friend, ykwd, are travelling in Shevchenko's Park! The park is beautiful - but large, indeed. N feature spots in the park are connected by exactly (N-1) undirected path原创 2017-06-12 08:07:03 · 560 阅读 · 0 评论 -
Cow Exhibition
Cow Exhibition题目描述:给你n只奶牛,每只奶牛有两个属性值,分别是聪明值S和有趣值F,并且这些值存在负数,我们需要选取k只牛使得他们的聪明值和兴趣值的和最大,并且要保证TS = S_1 + S_2 + S_3 + …… + S_n(也就是聪明值的和) >= 0, TF = F_1 + F_2 + F_3 + ……+ F_n(也就是有趣值的和) >= 0。这个时候再使得TS+TF最大。输原创 2017-05-07 09:36:56 · 555 阅读 · 0 评论 -
01背包(Bone Collector)
重新回顾一下背包问题,特来贴一篇博客。01背包问题01背包是背包问题的基础,基本上其他背包问题都是由他扩展而来,可以看出他的重要性。题目:有N件物品和一个容量为V的背包。放入第i件物品所消耗的空间是C,得到的价值是W_i,求解将那些物品装入背包可以使价值最大。分析:对于每一种物品我们只有选与不选两种状态,根据动态规划的一般解题思路,我们首先要确定阶段,状态,决策。阶段:前i件物品为一个阶段 状态:原创 2017-05-04 16:00:31 · 284 阅读 · 0 评论 -
Max Sum(DP)
Given a sequence a11,a22,a33......ann, your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +原创 2017-04-06 10:07:47 · 370 阅读 · 0 评论 -
Advanced Fruits
Advanced Fruits The company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most times this method原创 2017-04-06 09:57:24 · 936 阅读 · 0 评论 -
Charm Bracelet
Charm BraceletBessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each ch原创 2017-04-10 15:10:42 · 340 阅读 · 0 评论 -
Knapsack Problem(完全背包)
Knapsack ProblemYou have N kinds of items that you want to put them into a knapsack. Item i has value vi and weight wi.You want to find a subset of items to put such that:The total value of the items i原创 2017-04-10 11:01:25 · 896 阅读 · 0 评论 -
0-1 Knapsack Problem
0-1 Knapsack ProblemYou have N items that you want to put them into a knapsack. Item i has value vi and weight wi.You want to find a subset of items to put such that:The total value of the items is as原创 2017-04-10 09:59:14 · 1878 阅读 · 0 评论 -
E - The Triangle
E - The Triangle7 3 8 8 1 0 2 7 4 4 4 5 2 6 5Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the to原创 2017-04-09 12:06:49 · 322 阅读 · 0 评论 -
Edit Distance (Levenshtein Distance)
Edit Distance (Levenshtein Distance)Find the edit distance between given two words s1 and s2.The disntace is the minimum number of single-character edits required to change one word into the other. The原创 2017-04-09 11:55:01 · 377 阅读 · 0 评论 -
Longest Increasing Subsequence
Longest Increasing SubsequenceFor a given sequence A = {a0, a1, … , an-1}, find the length of the longest increasing subsequnece (LIS) in A.An increasing subsequence of A is defined by a subsequence {a原创 2017-04-07 16:23:48 · 319 阅读 · 0 评论 -
Longest Common Subsequence
Longest Common Subsequence最長共通部分列最長共通部分列問題 (Longest Common Subsequence problem: LCS)は、2つの与えられた列 X={x1,x2,...,xm}X = \{x_1, x_2, ..., x_m\} と Y={y1,y2,...,yn}Y = \{y_1, y_2, ..., y_n\} の最長共通部分列を求める問題です。原创 2017-04-07 15:35:52 · 369 阅读 · 0 评论 -
最长上升子序列
题意:1759:最长上升子序列总时间限制: 2000ms内存限制: 65536kB描述一个数的序列bi,当b1 b2 < ... <bS的时候,我们称这个序列是上升的。对于给定的一个序列(a1, a2, ...,aN),我们可以得到一些上升的子序列(ai1, ai2, ...,aiK),这里1 i1 i2 < ... <iK 你的任务,就是对于给定的序列原创 2016-09-20 19:18:22 · 378 阅读 · 0 评论 -
Tree Cutting(树的重心)
Tree CuttingAfter Farmer John realized that Bessie had installed a "tree-shaped" network among his N (1 <= N <= 10,000) barns at an incredible cost, he sued Bessie to mitigate his losses.Bessie, feelin原创 2017-06-13 20:12:19 · 748 阅读 · 0 评论