[POJ 2456]Aggressive cows[二分]

真·skysys

于 2016-07-20 16:53:25 发布

阅读量723

点赞数 1

分类专栏：算法与数学文章标签： poj 二分

请明确标注出处

本文链接：https://blog.youkuaiyun.com/qq_33583069/article/details/51970031

版权

算法与数学专栏收录该内容

469 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

农夫约翰新建了一个长形牛棚，包含N个位置的隔间。为了防止C头不喜此布局的奶牛互相攻击，他需要安排奶牛的位置，使得它们之间的最小距离最大化。输入包含牛棚位置和奶牛数量，输出最大可能的最小距离。样例输入和输出展示了如何分配位置以达到3的最大最小距离。建议使用scanf处理大输入数据。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest Lucifinil Log Out
Mail:0(0)
Login Log Archive
Language:
Aggressive cows
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 10864 Accepted: 5358

Description
Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,…,xN (0 <= xi <= 1,000,000,000).

His C (2 <= C <= N) cows don’t like this barn layout and become aggressive towards each other once put into a stall. To prevent the cows from hurting each other, FJ want to assign the cows to the stalls, such t