不积跬步无以至千里

题目一层里面有400个房间，北边和南边各有200个房间，要从一个房间里面把一张桌子移动到另一个房间，需要占用这两个房间之间的所有走廊（包括这两个房间前面的），每移动一个桌子需要10分钟，给出需要移动的桌子的数据（从哪移动到哪），要求计算出最少需要多少分钟才能把所有桌子移动完。分析题很简单，但是一定要看题目里面的那个图。要注意的只有一点，房间1和2前面是同一个走廊，所

度度熊与邪恶大魔王  Accepts: 3666  Submissions: 22474 Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 32768/32768 K (Java/Others)Problem Description度度熊为了拯救可爱的公主，于是与邪恶大魔王战斗

WarcraftTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1766    Accepted Submission(s): 950Problem DescriptionHave you ever play

CompromiseTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8710Accepted: 3703Special JudgeDescriptionIn a few months the European Currency Union

Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 52938Accepted: 23611DescriptionA numeric sequence of ai is ordered if a1 a

Testing the CATCHERTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 18448Accepted: 6773DescriptionA military contractor for the Department of Defense

Bridging signalsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 14420Accepted: 7804Description'Oh no, they've done it again', cries the chief designe

Human Gene FunctionsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 19782Accepted: 11038DescriptionIt is well known that a human gene can be consider

Railway ticketsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3089Accepted: 1097DescriptionThe railway line "Ekaterinburg-Sverdlovsk" with several s

MinistryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5020Accepted: 1622Special JudgeDescriptionMr. F. wants to get a document be signed by a

Lucky ticketsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3376Accepted: 2235DescriptionThe public transport administration of Ekaterinburg is anxi

Ferry Loading IITime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4042Accepted: 2030DescriptionBefore bridges were common, ferries were used to transpo

Nearest number - 2Time Limit: 5000MSMemory Limit: 65536KTotal Submissions: 4232Accepted: 1311DescriptionInput is the matrix A of N by N non-negative integer

Rikka with SubsetTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 837    Accepted Submission(s): 411Problem DescriptionAs we know

Moo VolumeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 22521Accepted: 6824DescriptionFarmer John has received a noise complaint from his neighbor,

Mr. Young's Picture PermutationsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1165Accepted: 576DescriptionMr. Young wishes to take a picture of his

1.POJ动态规划题目列表           容易：1018, 1050, 1083, 1088, 1125, 1143, 1157, 1163, 1178, 1179, 1189, 1208, 1276,1322, 1414, 1456, 1458, 1609, 1644, 1664, 1690, 1699, 1740(博弈),1742, 1887, 1926(马尔科夫矩阵，求平衡

1021 石子归并基准时间限制：1 秒 空间限制：131072 KB 分值: 20 难度：3级算法N堆石子摆成一条线。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的代价。计算将N堆石子合并成一堆的最小代价。例如： 1 2 3 4，有不少合并方法1 2 3 4 =>

1050 循环数组最大子段和基准时间限制：1 秒 空间限制：131072 KB 分值: 10 难度：2级算法题 收藏 关注N个整数组成的循环序列a[1],a[2],a[3],…,a[n]，求该序列如a[i]+a[i+1]+…+a[j]的连续的子段和的最大值（循环序列是指n个数围成一个圈，因此需要考虑a[n-1],a[n],a[1],a[2

To the MaxTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 49148Accepted: 26030DescriptionGiven a two-dimensional array of positive and negative integ

滑雪Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 98203Accepted: 37290DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或

The TriangleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 49860Accepted: 30112Description73 88 1 02 7 4 44 5 2 6 5(Figu

PalindromeTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 63457Accepted: 22128DescriptionA palindrome is a symmetrical string, that is, a string read

Cheapest PalindromeTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 9961Accepted: 4780DescriptionKeeping track of all the cows can be a tricky task so

Milking TimeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9937Accepted: 4124DescriptionBessie is such a hard-working cow. In fact, she is so focuse

ZipperTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 18632Accepted: 6638DescriptionGiven three strings, you are to determine whether the third strin

AGTCTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 13329Accepted: 5040DescriptionLet x and y be two strings over some finite alphabet A. We would li

LITTLE SHOP OF FLOWERSTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21639Accepted: 10007题意： 花店橱窗布置  某花店现有F束花，每一束花的品种都不一样，同时至少有同样数量的花瓶，被按顺序摆成一行，

DividingTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 71505Accepted: 18647DescriptionMarsha and Bill own a collection of marbles. They want to spli

Space ElevatorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12063Accepted: 5731DescriptionThe cows are going to space! They plan to achieve orbit b

Apple CatchingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12817Accepted: 6227DescriptionIt is a little known fact that cows love apples. Farmer J

Find a multipleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8078Accepted: 3523Special JudgeDescriptionThe input contains N natural (i.e. pos

Recaman's SequenceTime Limit: 3000MSMemory Limit: 60000KTotal Submissions: 23384Accepted: 10128DescriptionThe Recaman's sequence is defined by a0 = 0 ; for m

Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 53101Accepted: 22026DescriptionA subsequence of a given sequence is the given seque

World Cup NoiseTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 17861Accepted: 8707DescriptionBackground "KO-RE-A, KO-RE-A" shout 54.000 happy footb

TrickGCDTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 875    Accepted Submission(s): 343Problem DescriptionYou are given an