POJ2456 Aggressive cows
来源:互联网 发布:知茵是否有网上旗舰店 编辑:程序博客网 时间:2024/06/08 01:06
Aggressive cows
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13993 Accepted: 6775
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 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?
Input
* 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
Output
* Line 1: One integer: the largest minimum distance
Sample Input
5 312849
Sample Output
3
Hint
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.
Source
USACO 2005 February Gold
————————————————————————————————————
题目的意思是给出n个坐标,选出n个位置使得最小的距离最大
思路:二分加验证
#include <iostream>#include<queue>#include<cstdio>#include<algorithm>#include<cmath>#include<set>#include<cstring>using namespace std;#define LL long longint n,k;int a[100005];bool ok(int xx){ int cnt=1; int x=a[0]; for(int i=1;i<n;i++) { if(a[i]-x>=xx) { cnt++; x=a[i]; } } if(cnt>=k) return 1; else return 0;}int main(){ while(~scanf("%d%d",&n,&k)) { for(int i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); int l=1,r=1e9; int ans=-1; while(l<=r) { int mid=(l+r)/2; if(ok(mid)) { l=mid+1; ans=mid; } else r=mid-1; } printf("%d\n",ans); } return 0;}
0 0
- POJ2456 Aggressive cows
- POJ2456 Aggressive cows
- POJ2456 Aggressive cows (二分)
- POJ2456 Aggressive cows 二分
- POJ2456-Aggressive cows
- POJ2456 Aggressive cows
- POJ2456 Aggressive cows
- POJ2456-Aggressive cows
- poj2456 Aggressive cows
- POJ2456 Aggressive cows(二分+贪心)
- POJ2456 Aggressive cows 二分+判断
- POJ2456 -- Aggressive cows(二分搜索)
- POJ2456 Aggressive cows(二分搜索)
- POJ2456 Aggressive cows(对整数二分)
- poj2456-Aggressive cows(nyoj586)【贪心-二分】
- POJ2456 Aggressive cows 最大值最小化(二分)
- POJ2456(Aggressive cows)(贪心+二分)
- POJ2456 Aggressive cows题解及其分析
- 在二叉查找树中插入节点
- Android对象序列化
- git入门日常
- SQL,从熟练到掌握
- 程序员 你努力的方向对吗?
- POJ2456 Aggressive cows
- ACM刷题之ZOJ————Let's Chat
- #error和#line
- Gate 7.2的安装与部署(三)
- android recovery mode debug notes on msm8909 platform
- Oracle之DataGurd(DG)环境搭建
- Android实现双击事件
- JAVA程序性能调优笔记(2) -强引用、软引用、弱引用、虚引用
- 李开复对程序员的建议