POJ 2456 Aggressive cows【二分:最大化最小值】
来源:互联网 发布:mysql计算总数 编辑:程序博客网 时间:2024/06/03 13:38
Aggressive cows
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14220 Accepted: 6887
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
Point:
1.区间为[lb,ub)前闭后开
#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<queue> #include<stack> #include<vector> #include<map> #include<algorithm> using namespace std; #define ll long long #define ms(a,b) memset(a,b,sizeof(a)) const int M=1e5+10; const int inf=0x3f3f3f3f; const int mod=1e9+7; int a[M]; int i,j,k,n,m;bool check(int mid){int last=0;for(int i=1;i<k;i++){int cur=last+1;while(cur<n&&(a[cur]-a[last])<mid)cur++;if(cur==n)return false;last=cur;}return true;}int main(){while(~scanf("%d%d",&n,&k)){for(int i=0;i<n;i++)scanf("%d",&a[i]);sort(a,a+n);int lb=0,ub=1000000000;while(ub-lb>1){int mid=(lb+ub)/2;if(check(mid))lb=mid;else ub=mid;}printf("%d\n",lb);}return 0;}
阅读全文
0 0
- poj 2456 Aggressive cows,二分,最大化最小值
- POJ 2456 Aggressive cows【二分:最大化最小值】
- Aggressive cows POJ 2456 (二分,最大化最小值)
- POJ 25456 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 && NYOJ 586 疯牛(最大化最小值 贪心+二分搜索)
- POJ 2456 Aggressive cows (牛舍安放_二分+最大化最小值)
- CSU-ACM2017暑假集训2-二分搜索 poj-2456 Aggressive cows-最大化最小值
- Chrome 浏览器某些端口不能访问 建立IIS的时候尽量避免
- ok请求数据三级缓存的使用
- 项目中删除功能
- Android异步任务AsyncTask的使用与原理分析
- Java 多线程
- POJ 2456 Aggressive cows【二分:最大化最小值】
- 数据库的三大范式详解
- [leetcode]168. Excel Sheet Column Title
- java学习 jstl标签中fmt标签格式化日期
- android检查内存泄漏
- shellScript之函数中的全局变量和局部变量
- Linux命令之ls
- 2780: [Spoj]8093 Sevenk Love Oimaster
- gridcontrol设置表头序号列标题