POJ 2456 Aggressive cows
来源:互联网 发布:大头视频制作软件 编辑:程序博客网 时间:2024/05/22 06:31
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 that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?
* Line 1: Two space-separated integers: N and C
* Lines 2..N+1: Line i+1 contains an integer stall location, xi
* Lines 2..N+1: Line i+1 contains an integer stall location, xi
* Line 1: One integer: the largest minimum distance
5 312849
3
OUTPUT DETAILS:
FJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3.
Huge input data,scanf is recommended
FJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3.
Huge input data,scanf is recommended
思路:二分法+贪心
如果不适用贪心,很容易时间超限。
贪心思路:最小间隔0与最大间隔(str[N]-str[0])/(C-1),距离不断缩小,直到区间为0。
#include<cstdio>#include<algorithm>#include<cstdlib>using namespace std;int N,C;int str[1000005];int greed(int n){ int imax=str[1],sum=0; for(int i=1;i<=N;i++) { if(str[i]-imax>=n) { sum++; imax=str[i]; } } return sum>=C-1? 1:0;//判断}int main(){ //freopen("e;//in.txt","r",stdin); while(scanf("%d%d",&N,&C)==2) { for(int i=1;i<=N;i++) scanf("%d",&str[i]); sort(str,str+N); //输入 int left=0,right=(str[N]-str[0])/(C-1),mid; while(left<=right) { mid=(left+right)/2; if(greed(mid))//如果间隔为mid,可以放下 left=mid+1; else //不可以放下 right=mid-1; } printf("%d\n",left-1);//特别注意mid 有可能不能放下c 只羊,我们能够确定left 左边的能够放下c 只羊,right 右边的不能放下c 只羊,可是mid 不能确定;如果mid 能够放下,则left 右移,left=right+1 ,显然不能放下,则left-1 是最大值;如果mid 不能放下,则left 不变,left 依然不能不能放下,left-1 是最大值 } return 0;}
1 0
- Poj 2456 Aggressive cows
- POJ 2456 Aggressive cows
- poj 2456 Aggressive cows
- poj 2456 Aggressive cows
- POJ-2456-Aggressive cows
- POJ 2456 Aggressive cows
- POJ-2456 Aggressive cows
- poj 2456 Aggressive cows
- POJ 2456 Aggressive cows
- POJ 2456 Aggressive cows
- poj 2456 Aggressive cows
- POJ 2456 Aggressive cows
- POJ 2456 Aggressive cows
- POJ-2456 Aggressive cows
- POJ-2456Aggressive cows
- POJ 2456 - Aggressive cows
- POJ 2456 Aggressive cows
- poj 2456 Aggressive cows
- 【使用线程池的好处】多线程的环境中,尽量采用线程池
- Mac OS 安装Maven
- maven 编译出错 Failed to execute goal org.apache.maven.plugins:maven-clean-plugin:2.5:clean
- mysql 5.7.13 安装配置方法图文教程(linux)
- Python中sorted函数的用法
- POJ 2456 Aggressive cows
- 如何修佛修心——读《了凡四训讲记》记
- QML 中的 Markdown 支持
- Mysql常见水平分表方案
- json序列化数据超出最大值(maxJsonLength)
- LeetCode 31. Next Permutation
- 设置包含路径 及require_once需要注意问题
- linux的那些事儿之链接脚本(link script)
- session共享