杂
文章平均质量分 88
Twenty_seven
这个作者很懒,什么都没留下…
展开
-
poj1064二分搜索
如题:http://poj.org/problem?id=1064 Cable masterTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25713 Accepted: 5528DescriptionInhabitants of the Wonder原创 2015-03-05 11:09:42 · 411 阅读 · 0 评论 -
poj1028 栈
如题:http://poj.org/problem?id=1028Web NavigationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30623 Accepted: 13717DescriptionStandard web brow原创 2015-05-03 00:25:24 · 346 阅读 · 0 评论 -
poj1029 模拟
如题:http://poj.org/problem?id=1029False coinTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17541 Accepted: 4898DescriptionThe "Gold Bar"bank received in原创 2015-05-03 15:09:43 · 457 阅读 · 0 评论 -
poj3273 最大值最小化
如题:http://poj.org/problem?id=3273Monthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17781 Accepted: 7115DescriptionFarmer John is an astou原创 2015-08-12 13:32:38 · 327 阅读 · 0 评论 -
poj3258 二分最小值最大化
如题:http://poj.org/problem?id=3258 River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9150 Accepted: 3951DescriptionEvery year the cows h原创 2015-08-12 11:07:29 · 337 阅读 · 0 评论 -
poj3111 二分最大化平均值
如题:http://poj.org/problem?id=3111K BestTime Limit: 8000MS Memory Limit: 65536KTotal Submissions: 7073 Accepted: 1848Case Time Limit: 2000MS Special JudgeD原创 2015-08-13 11:10:33 · 375 阅读 · 0 评论 -
poj3685 多重二分
如题:http://poj.org/problem?id=3685MatrixTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 5289 Accepted: 1440DescriptionGiven a N × N matrix A, whose ele原创 2015-08-13 20:40:36 · 381 阅读 · 0 评论 -
poj3045 贪心
如题http://poj.org/problem?id=3045 Cow AcrobatsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3425 Accepted: 1333DescriptionFarmer John's N (1 <= N <=原创 2015-08-12 21:16:05 · 371 阅读 · 0 评论 -
poj3579 二分
如题:http://poj.org/problem?id=3579 MedianTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4518 Accepted: 1389DescriptionGiven N numbers, X1,X2, ..原创 2015-08-13 14:39:20 · 379 阅读 · 0 评论 -
poj2976 二分最大平均值
如题:http://poj.org/problem?id=2976Dropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7697 Accepted: 2686DescriptionIn a certain course, you原创 2015-08-13 10:13:04 · 333 阅读 · 0 评论 -
poj3662 二分+spfa
如题:http://poj.org/problem?id=3662Telephone LinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5390 Accepted: 1968DescriptionFarmer John wants to s原创 2015-08-15 18:41:23 · 383 阅读 · 0 评论 -
poj2010 二分中位数
如题:http://poj.org/problem?id=2010Moo University - Financial AidTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6010 Accepted: 1789DescriptionBessie note原创 2015-08-15 11:06:30 · 347 阅读 · 0 评论 -
poj1013 模拟
如题:http://poj.org/problem?id=1013Counterfeit DollarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 41224 Accepted: 13142DescriptionSally Jones has a doz原创 2015-04-21 15:05:56 · 412 阅读 · 0 评论 -
poj1008 模拟
如题:http://poj.org/problem?id=1008 Maya CalendarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 69409 Accepted: 21362DescriptionDuring his last sabbati原创 2015-04-20 08:35:55 · 378 阅读 · 0 评论 -
poj1018 枚举+剪枝
大致题意:某公司要建立一套通信系统,该通信系统需要n种设备,而每种设备分别可以有m1、m2、m3、...、mn个厂家提供生产,而每个厂家生产的同种设备都会存在两个方面的差别:带宽bandwidths 和 价格prices。现在每种设备都各需要1个,考虑到性价比问题,要求所挑选出来的n件设备,要使得B/P最大。其中B为这n件设备的带宽的最小值,P为这n件设备的总价。 解题转载 2015-04-23 14:00:30 · 3292 阅读 · 0 评论 -
poj2456 二分搜索
如题:http://poj.org/problem?id=2456 Aggressive cowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6930 Accepted: 3450DescriptionFarmer John has built a原创 2015-03-06 10:53:11 · 356 阅读 · 0 评论 -
poj3061 尺取法
如题:http://poj.org/problem?id=3061SubsequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9164 Accepted: 3661DescriptionA sequence of N positive integ原创 2015-03-06 14:59:29 · 348 阅读 · 0 评论 -
poj3279 翻转
如题:http://poj.org/problem?id=3279FliptileTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3867 Accepted: 1483DescriptionFarmer John knows that an intel原创 2015-03-08 21:07:45 · 302 阅读 · 0 评论 -
poj3320 尺取法
如题:http://poj.org/problem?id=3320 Jessica's Reading ProblemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7512 Accepted: 2387DescriptionJessica's a原创 2015-03-06 16:53:52 · 308 阅读 · 0 评论 -
poj3276 翻转
如题:http://poj.org/problem?id=3276Face The Right WayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2858 Accepted: 1317DescriptionFarmer John has arran原创 2015-03-08 17:38:03 · 320 阅读 · 0 评论 -
超大背包
这是>的一道题,与大家分享。这里有一个人已经写了,思路很清晰,我来转载一下。 超大背包问题:有n个重量和价值分别为w[i]和v[i]的物品,从这些物品中挑选总重量不超过W的物品,求所有挑选方案中价值总和的最大值。其中,1 ≤ n ≤ 40, 1 ≤ w[i], v[i] ≤ 10^15, 1 ≤ W ≤ 10^15.这个问题给人的第一感觉就是普通的01背包。不过,看完数据范围会转载 2015-03-09 18:28:24 · 645 阅读 · 0 评论 -
poj2785 折半枚举
如题:http://poj.org/problem?id=27854 Values whose Sum is 0Time Limit: 15000MS Memory Limit: 228000KTotal Submissions: 16388 Accepted: 4753Case Time Limit: 5000MS原创 2015-03-09 17:11:41 · 318 阅读 · 0 评论 -
poj1002
如题:http://poj.org/problem?id=1002 487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 254570 Accepted: 45329DescriptionBusinesses like to have mem原创 2015-04-18 09:57:21 · 272 阅读 · 0 评论 -
poj 1003
如题:http://poj.org/problem?id=1003 HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 107427 Accepted: 52397DescriptionHow far can you make a st原创 2015-04-18 10:19:44 · 275 阅读 · 0 评论 -
poj1004
如题:http://poj.org/problem?id=1004Financial ManagementTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 158311 Accepted: 60415DescriptionLarry graduated th原创 2015-04-18 10:43:43 · 290 阅读 · 0 评论 -
poj1005
如题:http://poj.org/problem?id=1005I Think I Need a HouseboatTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 91238 Accepted: 39641DescriptionFred Mapper i原创 2015-04-18 12:10:18 · 310 阅读 · 0 评论 -
poj1759 二分
如题:http://poj.org/problem?id=1759GarlandTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1504 Accepted: 661DescriptionThe New Year garland consists of N原创 2015-08-15 22:23:17 · 479 阅读 · 0 评论