Aggressive cows POJ
来源:互联网 发布:两组数据相似性分析 编辑:程序博客网 时间:2024/05/22 02:22
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?
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.
在位置上放牛,让牛相邻的位置尽可能的大,输出这种情况下最短的距离
二分搜索距离;;
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int M=100005;int a[M];int n,k;int c(int x){ int l=1,t=a[0]; for(int i=0;i<n;i++) { if(a[i]-t>=x) { l++; t=a[i]; } } if(l>=k) return 1; else return 0;}int main(){ while(~scanf("%d%d",&n,&k)) { memset(a,0,sizeof(a)); for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); int l=0,r=a[n-1]; while(r-l>1) { int mid=(l+r)>>1; if(c(mid)) l=mid; else r=mid; } printf("%d\n",l); } return 0;}
阅读全文
0 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
- R-3.3.1源码安装
- 线段树详解 (原理,实现与应用)
- 解决如source insight等软件由于编码格式不一样出现中文乱码显示问题
- android.intent.action.MAIN 与 android.intent.category.LAUNCHER
- DELETE操作出现:ORA-30036: 无法按 1024 扩展段 (在撤消表空间 'UNDOTBS_1' 中)
- Aggressive cows POJ
- Jfinal 连接Sqlserver 数据库
- 数据结构--二叉树
- Javascript 中 include 文件
- 深入分析单例模式
- POJ 2689 Prime Distance
- Django进阶
- xposed的总开关
- 神经网络系列讲解之离散型Hopfield网络