即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

E – 05

编程语言 sinat_37668729 30℃ 0评论

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?

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

5 3
1
2
8
4
9

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.


题意:

某人搭了一间有N间牛舍的小屋,c支牛,每个牛距离都不想太紧,问牛之间能达到得最小距离!!一看最大值的最小值问题,大多数就要使用二分算法!

思路:

采用二分查找的思想,对中间值进行寻找,类似于课堂上讲的那个移动石头的题目!

代码:

#include
#include
#include
#include
#include
using namespace std;
#define N 100005
int a[N];
int main()
{
 //freopen("1.txt","r",stdin);
 int n,c,i,mid,lp,rp;
 scanf("%d %d",&n,&c);
 for(i=1;i<=n;i++)
 {
     scanf("%d",&a[i]);
 }
 sort(a,a+n);
    lp=0;rp=2000000000;
 while(lpmid) //细节处理
         {cnt++;j=i;}
        }
        if(cnt



心得:

典型的二分查找,还是理解有点不透彻!!!!

转载请注明:CodingBlog » E – 05

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情