POJ 2456 Aggressive cows (最大化最小值)
来源:互联网 发布:windows 10画图 编辑:程序博客网 时间:2024/05/21 08:37
题意:一群好斗的奶牛,再能安排所有奶牛的情况下, 让最近的奶牛离得尽可能的远。
解题思路:输入进来的牛舍的距离是无序的,所以先排序,二分枚举可能的距离, 查看是否能把所有的奶牛全部安排开,若不能,压缩上界, 若能压缩下界找更优解。
问题描述
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<algorithm>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<cctype>#include<list>#include<iostream>#include<map>#include<queue>#include<set>#include<stack>#include<vector>using namespace std;#define FOR(i, s, t) for(int i = (s) ; i <= (t) ; ++i)#define REP(i, n) for(int i = 0 ; i < (n) ; ++i)int buf[10];inline long long read(){ long long x=0,f=1; char ch=getchar(); while(ch<'0'||ch>'9') { if(ch=='-')f=-1; ch=getchar(); } while(ch>='0'&&ch<='9') { x=x*10+ch-'0'; ch=getchar(); } return x*f;}inline void writenum(int i){ int p = 0; if(i == 0) p++; else while(i) { buf[p++] = i % 10; i /= 10; } for(int j = p - 1 ; j >= 0 ; --j) putchar('0' + buf[j]);}/**************************************************************/#define MAX_N 100005const int INF = 0x3f3f3f3f;int a[MAX_N];int n, c;bool f(int x){ int h = 0;// int l = h + 1; for(int i = 1 ; i < c ; i++) { int l = h + 1; while(l < n && a[l] - a[h] < x) { l++; } if(l == n) return false; h = l; } return true;}int main(){ while(~scanf("%d%d", &n, &c)) { for(int i = 0 ; i < n ; i++) { a[i] = read(); } sort(a, a + n); int lb = -1, ub = INF; while(ub - lb > 1) { int m = (ub + lb) / 2; if(f(m)) lb = m; else ub = m; } printf("%d\n", lb); } return 0;}
0 0
- poj 2456 Aggressive cows,二分,最大化最小值
- POJ 2456 Aggressive cows (最大化最小值)
- POJ 2456 Aggressive cows【二分:最大化最小值】
- Aggressive cows POJ 2456 (二分,最大化最小值)
- 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 25456 Aggressive cows 【二分最大化最小值】
- poj 3258 River Hopscotch && poj 2456 Aggressive cows(最大化最小值)
- 【贪心专题】POJ 2456 Aggressive cows && NYOJ 586 疯牛(最大化最小值 贪心+二分搜索)
- POJ 2456 Aggressive cows (牛舍安放_二分+最大化最小值)
- CS的顶级会议和期刊
- 惠普第一周
- Find and Retain Passionate Problem Solvers
- 学无止境:8月最热免费优秀资源推荐
- jquery 页面,发送验证码,本页调用ajax
- POJ 2456 Aggressive cows (最大化最小值)
- Sum Root to Leaf Numbers
- BestCoder Round #54 (div.2) HDU 5427 A problem of sorting(1001)
- .Net中C#的DllImport的用法
- HTTP返回状态码
- 绘画基础学习之两点透视原理
- LINUX中的".c”文件用vi打开后出现好多^M的解决方法
- 程序员的 13 种噩梦,你遇到过哪些?
- hdu 4278 Faulty Odometer 2012 天津网络赛 数位dp