[POJ 2456]Aggressive cows[二分]
来源:互联网 发布:手机摇晃解锁软件 编辑:程序博客网 时间:2024/06/05 10:15
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 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
Output
* Line 1: One integer: the largest minimum distance
Sample Input
5 3
1
2
8
4
9
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.
Source
USACO 2005 February Gold
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;int n,c;typedef long long ll;const int maxn = 100010;const ll INF = 1000000000;int pos[maxn];bool check(int k){ int last = 0; for(int i=1;i<c;i++) { int cur = last + 1; while(cur<n&&pos[cur]-pos[last]<k)cur++; if(cur==n)return false; last = cur; } return true;}int main(){ scanf("%d%d",&n,&c); for(int i=0;i<n;i++)scanf("%d",&pos[i]); sort(pos,pos+n); int l = 0, r = INF;// while(r-l>1)//[i,j) while(r-l>1) { int mid = ((ll)r+l)>>1; // cout<<"mid:"<<mid<<endl; if(check(mid)){ l = mid; // cout<<"l:"<<l<<endl; }else{ r = mid; // cout<<"r:"<<r<<endl; } } printf("%d\n",l);// while(1); return 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 3258 (二分)
- POJ 2456 Aggressive cows(二分)
- POJ 2456 - Aggressive cows(二分)
- poj 2456 Aggressive cows,二分,最大化最小值
- poj 2456 Aggressive cows(贪心+二分)
- Big Number hd 1212
- 迁移ASM文件之backup as copy tablespace
- maven Perhaps you are running on a JRE rather than a JDK?
- LaneCat网猫网络监控软件(内网版) V2.1.1603.3100 绿色版
- VC自定义消息
- [POJ 2456]Aggressive cows[二分]
- [headset]怎样定位插入耳机无法识别的问题
- Cisco-IOS_CLI
- AngularJS + Ionic 下拉刷新
- ContextLoaderListener初识
- MaxScale 安装
- Hadoop 新旧MapReduce API比较
- HBase工作原理学习
- online创建索引和重建索引