70分代码:
#include<iostream>
#include<algorithm>
using namespace std;
const unsigned int N=1e5+3;
int n,m,x[N];
inline bool check(int d)
{
int cow=1;
int rgt=x[1]=d;
for(int i=2;i<=n;++i)
{
if(x[i]<rgt)
{
continue;
}
++cow;
rgt=x[i]+d;
}
bool temp=(cow>=m);
return temp;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;++i)
{
cin>>x[i];
}
sort(x+1,x+n+1);
int l=0,r=x[n]-x[1];
while(l<=r)
{
int mid=l+r>>1;
if(check(mid))
{
l=mid+1;
}
else
{
r=mid-1;
}
}
cout<<r;
return 0;
}
70分 Record
WA on #1 #2 #10