#include<bits/stdc++.h>
using namespace std;
int n,d,k,x[500001],s[500001],ans,q[500001];
long long sum,f[500001];
long long dp(int l,int r)
{
long long cc=0;
int h=1,t=0,j=0;
memset(f,-0x7f,sizeof(f));
memset(q,0,sizeof(q));
f[0]=0;
for(int i=1;i<=n;i++)
{
while(x[i]-x[j]>=l&&j<i)
{
if(f[j]!=-0x7fffffff)
{
while(h<=t&&f[q[t]]<&#