最大化最小值poj2456Aggressive cows
来源:互联网 发布:淘宝商户成功案例 编辑:程序博客网 时间:2024/06/11 08:01
Aggressive cows
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15528 Accepted: 7440
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.
check(d)=可以安排所有的牛的位置使得最近的两头牛的距离都不小于d
求满足check(d)的最大的d的值。
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int maxn=1e5+10;int house[maxn];int n,m;const int inf=99999999;bool check(int d){ int last=0; for(int i=1;i<m;i++) { int crt=last+1; while(crt<n&&house[crt]-house[last]<d) { crt++; } if(crt==n)return false; last=crt; } return true;}void solve(){ sort(house,house+n); int lb=0,ub=inf; while(ub-lb>1) { int mid=(ub+lb)/2; if(check(mid)) lb=mid; else ub=mid; } printf("%d\n",lb);}int main(){ cin>>n>>m; for(int j=0;j<n;j++) scanf("%d",&house[j]); solve(); return 0;}
阅读全文
1 0
- 最大化最小值poj2456Aggressive cows
- poj2456Aggressive cows(二分+贪心)
- poj 2456 Aggressive cows,二分,最大化最小值
- POJ 2456 Aggressive cows (最大化最小值)
- POJ 25456 Aggressive cows 【二分最大化最小值】
- Aggressive cows(二分查找最大化最小值)
- POJ 2456 Aggressive cows【二分:最大化最小值】
- 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 (最小值最大化二分问题)
- hdu 1695(欧拉公式,容斥原理)
- 进程与线程
- Refletion2017.8.13
- 2017百度之星初赛2 小小粉丝度度熊
- PAT-Forwards on Weibo
- 最大化最小值poj2456Aggressive cows
- 小型游戏《笑傲江湖之精忠报国》全过程_05
- linux下两台pc互相拷贝文件
- 我的前端学习历程 (一)
- C++中的unique(),unique_copy(),sort()用法
- Python 面向对象(进阶篇)
- 树状数组的应用(区间修改+区间查询)
- maven的概述
- HDU3613 Best Reward(扩展KMP)