暑期集训3:几何基础练习题H: POJ

2018学校暑期集训第三天——几何基础

练习题H —— POJ - 2456

Aggressive cows

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?

Input

* Line 1: Two space-separated integers: N and C

* Lines 2..N+1: Line i+1 contains an integer stall location, xi

Output

* Line 1: One integer: the largest minimum distance

Sample Input

Sample Output

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.

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;int tree[100010];bool judge(int mid, int n, int m)
{int a = 0;for(int i=1; i<m; i++){int b=a+1;while(b<n && tree[b]-tree[a]<mid)b++;if(b==n)return false;a = b;}return true;
}int main(void)
{int n,m; cin >> n >> m;for(int i=0;i<n;i++)scanf("%d", &tree[i]);sort(tree,tree+n);int min=0,max=99999999;while(max-min>1){int mid=(min+max)/2;if(judge(mid,n,m))min = mid;elsemax = mid;}cout << min << endl; return 0;
}

暑期集训3:几何基础练习题H: POJ - 2456相关推荐

暑期集训3:几何基础练习题C: POJ - 1269
2018学校暑期集训第三天--几何基础练习题B -- POJ - 1269 Intersecting Lines We all know that a pair of distinct point ...
暑期集训3:几何基础练习题G: HDU - 1052
2018学校暑期集训第三天--几何基础练习题G -- HDU - 1052 (昨天加练题) Tian Ji -- The Horse Racing Here is a famous sto ...
暑期集训3:几何基础练习题F: CodeForces - 1007A
2018学校暑期集训第三天--几何基础练习题F -- CodeForces - 1007A Reorder the Array You are given an array of intege ...
暑期集训3:几何基础练习题D: HDU - 2036
2018学校暑期集训第三天--几何基础练习题D -- HDU - 2036 改革春风吹满地 " 改革春风吹满地, 不会AC没关系; 实在不行回老家, 还有一亩三分地. 谢谢 ...
暑期集训3:几何基础练习题B: HDU - 2001
2018学校暑期集训第三天--几何基础练习题B -- HDU - 2001 计算两点间的距离输入两点坐标(X1,Y1),(X2,Y2),计算并输出两点间的距离. Input 输入数据有多组,每组 ...
暑期集训3:几何基础练习题A: HDU - 2002
2018学校暑期集训第三天--几何基础练习题A -- HDU - 2002 计算球体积根据输入的半径值,计算球的体积. Input 输入数据有多组,每组占一行,每行包括一个实数,表示球的半径 ...
递推（2019暑期集训第一次校赛-H.统计ccsu）
2019暑期集训第一次校赛-H.统计ccsu 链接:https://ac.nowcoder.com/acm/contest/1068/H 来源:牛客网题目描述给一个长度不超过1e5的字符串s,字符 ...
暑期集训2:ACM基础算法练习题G:POJ - 1298
2018学校暑期集训第二天--ACM基础算法练习题G -- POJ - 1298 The Hardest Problem Ever Julius Caesar lived in a time o ...
暑期集训1:C++STL 练习题E:POJ-2431
2018学校暑期集训第一天--C++与STL 练习题E -- POJ - 2431 E - 二律背反的对偶 A group of cows grabbed a truck and ventured ...

暑期集训3:几何基础练习题H: POJ - 2456

Aggressive cows

暑期集训3:几何基础练习题H: POJ - 2456相关推荐

最新文章

热门文章

暑期集训3:几何基础 练习题H: POJ - 2456

Aggressive cows

暑期集训3:几何基础 练习题H: POJ - 2456相关推荐

最新文章

热门文章

暑期集训3:几何基础练习题H: POJ - 2456

暑期集训3:几何基础练习题H: POJ - 2456相关推荐