poj 2456 Aggressive cows 二分+贪心
来源:互联网 发布:淘宝卖家会员关系管理 编辑:程序博客网 时间:2024/05/16 05:24
Aggressive cows
题意:有c只牛,n个隔间,牛会打架,所以要牛之前的最小距离最大
思路:先把距离排序,两只牛最小距离是1,最大是(a[N - 1] - a[0]) / (c - 1),利用二分找中间位置mid的隔间距可能的取值,贪心是否能放下c只羊
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
题意:有c只牛,n个隔间,牛会打架,所以要牛之前的最小距离最大
思路:先把距离排序,两只牛最小距离是1,最大是(a[N - 1] - a[0]) / (c - 1),利用二分找中间位置mid的隔间距可能的取值,贪心是否能放下c只羊
//二分加贪心#define _CRT_SBCURE_MO_DEPRECATE#include<iostream>#include<stdlib.h>#include<stdio.h>#include<cstdio>#include<cmath>#include<algorithm>#include<string>#include<string.h>#include<set>#include<queue>#include<stack>#include<functional> using namespace std;int N, C;int a[100005];int fun(int x) { //贪心int k = 0; //记录能放入的羊的只数int m = a[0]; //初始化for (int i = 1; i < N; i++) {if (a[i] >= m + x) { //距离满足条件k++;m = a[i];}}if (k >= C - 1) return 1;else return 0;}int main(){while (cin >> N >> C) {for (int i = 0; i < N; i++) {cin >> a[i];}sort(a, a + N); //从小到大排序int max = (a[N - 1] - a[0]) / (C - 1); //最小值的上限 C个羊需要C-1个间隔int min = 1; //下限为1while (max >= min) { //二分int mid = (max + min) / 2;if (fun(mid) == 1) //贪心判断间隔为mid时,能否放下C只羊min = mid + 1;else max = mid - 1;}cout << min - 1 << endl; //循环结束之前,min = mid+1,现在需要把1减去}//system("pause");return 0;}
0 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 2456 Aggressive cows (二分+贪心) (最大化最小值)
- poj 2456 Aggressive cows (二分+贪心思想)
- POJ 2456 Aggressive cows(二分+贪心验证)
- POJ 2456 Aggressive cows 二分
- RMQ算法 - Sparse-Table
- json弹框的[object Object]怎么进一步获得值
- Android 之 点赞+收藏
- static的作用
- mysql 中having的用法
- poj 2456 Aggressive cows 二分+贪心
- android部分机型选择图片提示错误
- MyEclipse启动Tomcat正常,Tomcat自启动报错
- Ubuntu14.04下搜狗输入法安装(亲测)
- 计算几何模板大选
- Java数据类型和MySql数据类型对应表
- 颜色setBackground、setBackgroundColor、setBackgroundDrawable、setBackgroundResource的区别
- Javascript 原型链
- hdu3336Count the string