红100求调

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll k,n,m;
ll ans;
const int N=1e5;
ll d[N];
bool check(ll x)
{
	ll ans=0,t=0;
	for(int i=1;i<=n;i++)
	{
		if(d[i]-t<x) ans++;
		else t=d[i];
	}
	return ans<=m;
}
int main()
{
	scanf("%lld%lld%lld",&k,&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&d[i]);
	}
	ll l=1,r=k,mid;
	while(l<=r)
	{
		ll mid=(l+r)/2;
		if(check(mid))
		{
			ans=mid;
			l=mid+1;
		}
		else
		{
			r=mid-1;
		}
	}
	cout<<ans;
	
	return 0;
}