flqbestboy的专栏

Bone Collector Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 46 Accepted Submission(s) : 28Problem DescriptionMany years ago , in Teddy’s

Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1175 Accepted Submission(s): 489Problem DescriptionRecently, iSea wen

Robberies Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 18 Accepted Submission(s) : 8Problem DescriptionThe aspiring Roy the Robber has se

Max Sum Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 49 Accepted Submission(s) : 12Problem DescriptionGiven a sequence a[1],a[2],a[3]....

I NEED A OFFER! Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的

Humble Numbers Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 23 Accepted Submission(s) : 9Problem DescriptionA number whose only prime fac

Chores题目链接：http://poj.org/problem?id=1949Crawling in process...Crawling failedTime Limit:3000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionFarmer John

Big Event in HDU Time Limit : 10000/5000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 20 Accepted Submission(s) : 7Problem DescriptionNowadays, we all know that

Coins题目链接：http://poj.org/problem?id=1742Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 7 Accepted Submission(s) : 5Problem DescriptionW

题目描述Bessie像她的诸多姊妹一样，因为从Farmer John的草地吃了太多美味的草而长出了太多的赘肉。所以FJ将她置于一个及其严格的节食计划之中。她每天不能吃多过H (5 <= H <= 45,000)公斤的干草。 Bessie只能吃一整捆干草；当她开始吃一捆干草的之后就再也停不下来了。她有一个完整的N (1 <= N <= 500)捆可以给她当作晚餐的干草的清单。她自然想要尽量吃到更

Max Sequence Time Limit : 6000/3000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 3Problem DescriptionGive you N integers a1, a2 ...

Piggy-Bank Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 43 Accepted Submission(s) : 20Problem DescriptionBefore ACM can do anything, a bu

悼念512汶川大地震遇难同胞——珍惜现在，感恩生活 Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 51 Accepted Submission(s) : 20Problem Description急！灾区的食物依然短缺！为了挽

FATE Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 34 Accepted Submission(s) : 11Problem Description最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪

Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 16 Accepted Submission(s) : 9Problem DescriptionNowadays, a

装箱问题描述 Description 有一个箱子容量为v(正整数，o≤v≤20000)，同时有n个物品(o≤n≤30)，每个物品有一个体积 (正整数)。要求从 n 个物品中，任取若千个装入箱内，使箱子的剩余空间为最小。输入格式 Input Format 第一行，一个整数，表示箱子容量；第二行，一个整数，表示有n个物品；接下来n行，分别表示这n个物品的各自体积。 输出格式

公路乘车 描述 Description  一个特别的单行街道在每公里处有一个汽车站。顾客根据他们乘坐汽车的公里使来付费。例如下表就是一个费用的单子。没有一辆车子行驶超过10公里，一个顾客打算行驶n公里（1输入格式 Input Format  第一行十个整数分别表示行走1到10公里的费用（输出格式 Output Format  仅一个整数表示最少费用。 样例输入 Samp

数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10338 Accepted Submission(s): 6197Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描

免费馅饼 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 42 Accepted Submission(s) : 12Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大