本文主要是介绍数据结构与算法 Farmer John 问题 农夫锯木板问题，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into the N planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made; you should ignore it, too.
FJ sadly realizes that he doesn’t own a saw with which to cut the wood, so he mosies over to Farmer Don’s Farm with this long board and politely asks if he may borrow a saw.
Farmer Don, a closet capitalist, doesn’t lend FJ a saw but instead offers to charge Farmer John for each of the N-1
这篇关于数据结构与算法 Farmer John 问题 农夫锯木板问题的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
