这道题一开始我以为是dp,有考虑贪心!!哎,还是对算法不熟!!!
#include<iostream>
using namespace std;
#include<algorithm>
int a[500005];
int n,l;
bool ok(int mid,int m)
{
int temp;
int sum=0;
a[n+1]=l;
for(int i=1;i<=n+1;i++)
{
temp=a[i]-a[i-1];
if(temp>mid)
return false;
if(sum+temp<=mid)
{
sum+=temp;
}
else
{
sum=temp;
m--;
}
}
if(m<1)
return false;
return true;
}
int main()
{
int m;
int mid;
while(cin>>l>>n>>m)
{
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+1+n);
int left=1;
int right=l;
while(right>=left)
{
a[0]=0;
mid=(right+left)/2;
if(ok(mid,m))
{
right=mid-1;
}
else
{
left=mid+1;
}
}
cout<<left<<endl;
}
return 0;
}