算法基础 POJ ACM刷题
文章平均质量分 82
lishiqi_
这个作者很懒,什么都没留下…
展开
-
POJ 1088滑雪
题目:DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 7原创 2013-11-22 14:46:56 · 736 阅读 · 0 评论 -
POJ 2479 Maximum sum (2593)
DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:Your task is to calculate d(A).InputThe input consists of T(Each test case contains two lin原创 2013-11-24 00:21:31 · 695 阅读 · 0 评论 -
POJ 1050_To the Max
DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangl原创 2013-11-25 17:20:44 · 568 阅读 · 0 评论 -
POJ 1141_Brackets Sequence
DescriptionLet us define a regular brackets sequence in the following way: 1. Empty sequence is a regular sequence. 2. If S is a regular sequence, then (S) and [S] are both regular sequences原创 2013-11-25 15:03:48 · 685 阅读 · 0 评论 -
POJ 1080_Human Gene Functions
DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C, G, and T. Biologists have been intere原创 2013-11-26 14:19:02 · 623 阅读 · 0 评论 -
POJ 1125_Stockbroker Grapevine
原题链接:http://poj.org/problem?id=1125题目大意:要使消息最快传播到每个业务员。输入:第一行是表示有N个业务员,下面的N行,每一行表示第N个业务员与其他业务员传播消息的时间3 //有三个业务员2 2 4 3 5 //1号业务员可以跟2号业务员传播,时间是4分钟,可以和3号业务员传播,时间是5分钟2 1 2 3 62 1 2 2 2解题思原创 2013-12-03 19:29:49 · 702 阅读 · 0 评论 -
POJ 1083_Moving Tables 简单题
此题是简单题 题目http://poj.org/problem?id=1083大致题意:1每移动一次桌子要10分钟(跟路径远近无关),2走廊 一次只能过一张桌子。求最少需要的时间。解题思路:1,对输入数据进行整理 奇偶统一(因为1和2,3和4.。。是共用一个走廊) 大小对齐,如果移除房号大于移入房号,可以置换一下,方便计算。2,计算,我们要求的是每一个原创 2013-12-03 15:46:37 · 666 阅读 · 0 评论