- 博客(8)
- 收藏
- 关注
RSS订阅原创 POJ 3253 - Fence Repair（贪心）
Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 21562 Accepted: 6886DescriptionFarmer John wants to repair a small length of the fence aro
2014-01-14 00:01:47
619
原创 POJ 3617 - Best Cow Line（贪心）
Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7377 Accepted: 2322DescriptionFJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annua
2014-01-13 22:57:01
514
原创 POJ 3190 - Stall Reservations（贪心）
Stall ReservationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2278 Accepted: 811 Special JudgeDescriptionOh those picky N (1 <= N <= 50,000) c
2014-01-13 14:07:59
707
原创 POJ 1328 - Radar Installation（贪心）
Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45932 Accepted: 10256DescriptionAssume the coasting is an infinite straight line. La
2014-01-13 13:45:26
478
原创 POJ 2376 - Cleaning Shifts（贪心）
Cleaning ShiftsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9242 Accepted: 2461DescriptionFarmer John is assigning some of his N (1 <= N <= 25,000)
2014-01-13 13:23:48
729
原创 POJ 2718 - Smallest Difference（穷竭搜索）
Smallest DifferenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3238 Accepted: 910DescriptionGiven a number of distinct decimal digits, you can for
2014-01-13 12:55:12
597
原创 SGU 271 - Book Pile
271. Book Piletime limit per test: 0.25 sec.memory limit per test: 65536 KBinput: standardoutput: standardThere is a pile of N books on the table. Two types of operations are perfo
2014-01-07 19:15:59
505
原创 SGU 180 - Inversions（逆序数）
180. Inversionstime limit per test: 0.25 sec.memory limit per test: 4096 KBinput: standardoutput: standardThere are N integers (1A[j].InputThe first line of the input
2014-01-07 18:46:46
641
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人