POJ2456-Aggressive cows
来源:互联网 发布:计价软件试用版 编辑:程序博客网 时间:2024/06/04 19:44
Aggressive cows
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14024 Accepted: 6798
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个牛舍和c头牛,让c头牛住进牛舍,问任意两头牛之间最近距离最大为多少
解题思路:给n个牛舍进行排序,然后二分
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <cmath>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF=0x3f3f3f3f;int n,k;int a[100050];bool check(int x){ int sum=1,xx=a[1]; for(int i=2;i<=n;i++) { if(a[i]-xx>=x) sum++,xx=a[i]; if(sum>=k) break; } if(sum>=k) return 1; else return 0;}int main(){while(~scanf("%d%d",&n,&k)) { for(int i=1;i<=n;i++) scanf("%d",&a[i]); sort(a+1,a+1+n); int l=0,r=INF,ans; while(l<=r) { int mid=(l+r)>>1; if(check(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题解及其分析
- QTextEdit 当中添加图片的几种方式
- Date与String的相互转化
- 获取iOS设备唯一标识
- SCI论文投稿中图、表和公式的位置问题
- ONVIF协议网络摄像机(IPC)客户端程序开发(3):理解什么是Web Services
- POJ2456-Aggressive cows
- 使得ul标签中的li水平排列
- 基于支持向量机(SVM)的遗传疾病致病位点预测分析
- 链剖——BZOJ4196/Luogu2146 [Noi2015]软件包管理器
- Struts1框架一之项目的配置及执行流程
- ios开发之NSBundle
- 关于数据库主键和外键(终于弄懂啦)
- Discuz!教程之如何修改附件下载次数
- Linux命令基础29-head和tail命令