动态规划
醉小义
学习算法让自己有更大的提升
展开
-
杭电2084
数塔 在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?已经告诉你了,这是个DP的题目,你能AC吗?Input 输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1 <= N <= 100),表示数塔的高度,接下来用N行数字表示数塔,其中第i行有个原创 2015-10-18 16:44:51 · 466 阅读 · 0 评论 -
杭电1003--连续最长子序列
Max Sum Problem Description Given 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,5,4,-7), the max sum in this sequence is 6 + (-1) +原创 2015-11-08 22:56:02 · 441 阅读 · 0 评论 -
杭电1069--Monkey and Banana 子序列,dp
Monkey and Banana Problem Description A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide th原创 2015-11-10 21:52:23 · 485 阅读 · 0 评论 -
杭电1081--二维最大子序列
To The Max Problem Description Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater located within the whole array. The原创 2015-11-09 21:39:35 · 448 阅读 · 0 评论 -
杭电1025--不连续子序列Constructing Roads In JGShining's Kingdom
Constructing Roads In JGShining's Kingdom Problem Description JGShining’s kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities ar原创 2015-11-09 21:44:38 · 380 阅读 · 0 评论 -
杭电1466---计算直线的交点数
计算直线的交点数 Problem Description 平面上有n条直线,且无三线共点,问这些直线能有多少种不同交点数。 比如,如果n=2,则可能的交点数量为0(平行)或者1(不平行)。Input 输入数据包含多个测试实例,每个测试实例占一行,每行包含一个正整数n(n<=20),n表示直线的数量.Output 每个测试实例对应一行输出,从小到大列出所有相交方案,其中每个数为可能的交点数,每原创 2015-11-26 15:27:02 · 430 阅读 · 0 评论