#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
const int MAXN=100000+60;
int da[MAXN];
int n,m,mid,cur;
bool is_good(int place)
{
if(place==m+1)return 1;
int j=cur;
while(da[j]-da[cur]<mid)
{
j++;
if(j>=n)return 0;
}
if(da[n-1]-da[j]<(m-place)*mid)return 0;
cur=j;
return is_good(place+1);
}
int main()
{
int i;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&da[i]);
sort(da,da+n);
int key=(da[n-1]-da[0])/(m-1)+10;
int le=0,ri=key,ans=-1;
while(le<=ri)
{
mid=(le+ri)/2;cur=0;
if(is_good(2))
{
ans=mid;
le=mid+1;
}
else ri=mid-1;
}
printf("%d\n",ans);
return 0;
}
poj 2456 Aggressive cows (二分)
最新推荐文章于 2022-07-18 20:22:30 发布