贪心POJ3253

最新推荐文章于 2019-09-11 23:30:19 发布

原创

最新推荐文章于 2019-09-11 23:30:19 发布 · 821 阅读

4 ·

CC 4.0 BY-SA版权

文章标签：

#poj #贪心 #java #acm #算法

博客介绍了POJ3253问题，即农民约翰需要修理围栏，购买了一块长木板，需要锯成N段，每段长度不同。农民唐提供锯木服务，按长度收费。博客讨论了如何通过贪心策略找到锯木的最低成本，并给出了样例输入输出及解题思路。

/**
*@ author StormMaybin
*@ date 2016-09-27
*/

生命不息,奋斗不止!

题目分析

Fence Repair
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 41139 Accepted: 13409

Description

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.

最低0.47元/天解锁文章