poj——2456Aggressive cows(二分搜索 求牛牛之间最大距离)
来源:互联网 发布:mac chili色号 编辑:程序博客网 时间:2024/06/05 21:08
Aggressive cows
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11212 Accepted: 5502
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
#include<iostream>#include<string>#include<cmath>#include<cstring>#include<algorithm>using namespace std;int ub,lb;int n,m;int a[100004];bool C(int x){int d=0;for(int i=1;i<m;i++){int k=d+1;while(k<n&&a[k]-a[d]<x){k++;}if(k==n)return 0;d=k;}return 1;}void solve(){while(ub-lb>1){int mid=(ub+lb)/2;if(C(mid))lb=mid;else ub=mid;}}int main(){scanf("%d%d",&n,&m);for(int i=0;i<n;i++)scanf("%d",&a[i]);sort(a,a+n);ub=a[n-1]-a[0];lb=0;solve();printf("%d\n",lb);return 0;}
1 0
- poj——2456Aggressive 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 2456 Aggressive cows (二分、贪心)
- Poj 2456 Aggressive cows (二分逼近)
- POJ 2456 Aggressive cows (二分算法)
- POJ 2456 Aggressive cows (二分查找)
- 180.User SCOTT wants to perform a bulk insert operation in the EMP_DEP table. SCOTT receives the fol
- git仓库整理实战
- poj——3320Jessica's Reading Problem(尺取法 求最小看书页数)
- Linux下查看进程占用内存的最好方式
- poj——3061Subsequence(尺取法 求最小数量满足S)
- poj——2456Aggressive cows(二分搜索 求牛牛之间最大距离)
- prefuse同时做多个图---解决不连通图的坐标原点
- poj——1064Cable master(二分搜索 求绳子可以满足的最大长度)
- 体育之美
- poj——3169Layout(差分约束 求第一只牛到第n只牛最大距离)
- poj——3255Roadblocks(优先队列 求最小次最短路径)
- ajax异步请求刷新
- poj——1182食物链(并查集 每种动物扮演三种角色)
- python map, reduce, filter 函数