题解

#include <bits/stdc++.h>
using namespace std;
int n,k,m;
const int N=1e5+5;
int a[N];
bool check(int mid){

int cnt=0;
for(int i=2;i<=n;i++){
	if(a[i]-a[i-1]>mid){
        cnt+=(a[i]-a[i-1])/mid;
		if(a[i]-a[i-1]%mid==0){
			cnt--;
		}
    }
}
return cnt<=m;

}

int main(){

cin>>k>>n>>m;
for(int i=1;i<=n;i++){
	cin>>a[i];
}
int ans=0;
int l=0,r=k+1;
while(l<=r){
	int mid=(l+r)/2;
	if(check(mid)){
		r=mid-1;
		ans=mid;
	}else{
		l=mid+1;
	}
}
cout<<ans;
return 0;

}