在网络拥塞控制领域，我们知道有一个非常有名的算法叫做Nagle算法（Nagle
algorithm），这是使用它的发明人John Nagle的名字来命名的，John
Nagle在1984年首次用这个算法来尝试解决福特汽车公司的网络拥塞问题（RFC 896），该问题的具体描述是：如果我们的应用程序一次...
分类：
其他好文 时间：
2014-06-11 08:57:34
阅读次数：
267
Problem 1: Ski Lessons [Brian Jacokes,
2002]Farmer John wants to take Bessie skiing in Colorado. Sadly, Bessieis not
really a very good skier.Bessie h...
分类：
其他好文 时间：
2014-06-08 01:30:57
阅读次数：
406
Problem 1: Gifts [Kalki Seksaria and Brian
Dean, 2012]Farmer John wants to give gifts to his N (1 2 #include 3 #include 4
#include 5 #include 6 ...
分类：
其他好文 时间：
2014-06-08 00:46:18
阅读次数：
613
The Perfect StallTime Limit:1000MSMemory
Limit:10000KTotal Submissions:17768Accepted:8104DescriptionFarmer John completed
his new barn just last week,...
分类：
其他好文 时间：
2014-06-06 23:15:27
阅读次数：
273
Catch That CowDescriptionFarmer John has been
informed of the location of a fugitive cow and wants to catch her immediately.
He starts at a point N (0...
分类：
其他好文 时间：
2014-06-05 19:54:29
阅读次数：
298
Catch That Cow
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 43851
Accepted: 13674
Description
Farmer John has been informed of the location of a fugitiv...
分类：
其他好文 时间：
2014-06-05 07:45:38
阅读次数：
220
链接：http://poj.org/problem?id=3259
Description
While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path t...
分类：
其他好文 时间：
2014-06-05 05:26:33
阅读次数：
240
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,0...
分类：
其他好文 时间：
2014-06-03 05:30:23
阅读次数：
394
Rope Folding [Brian Dean, 2012]时间限制: 1 Sec
内存限制: 128 MB题目描述Farmer John has a long rope of length L (1 =f(i)的最大i值，递归即可。Work
Scheduling [Richard Peng, ....
分类：
其他好文 时间：
2014-06-02 17:40:21
阅读次数：
1039
Fence RepairTime Limit: 2000MSMemory Limit:
65536KTotal Submissions: 24393Accepted: 7812DescriptionFarmer John wants to
repair a small length of the f...
分类：
其他好文 时间：
2014-06-01 12:20:10
阅读次数：
210
