路标设置

zhangxuanju LV 9 @ 2024-11-5 19:39:12

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 +10;
const int INF=0x3f3f3f;
int ans,l,r,L,n,k,a[N];
bool check(int mid){
    int sum = 0;
    for(int i = 2;i<=n;i++)
    sum+=(a[i] - a[i-1] - 1) / mid;
    return sum <= k;
}
int main(){
    cin>>L>>n>>k;
    for(int i = 1;i<=n;i++)
    cin>>a[i];
    sort(a+1,a+n+1);
    r = a[n] - 1;
    while(l<=r){
        int mid = l + r >>1;
        if(check(mid)){
            ans = mid;
            r = mid - 1;
        }
            else
                l = mid + 1;
      }
    cout<<ans;
}

0
lvyouheng LV 7 @ 2026-10-29 22:39:41

mc.78.91 神秘网址
0
wenjianbo LV 8 @ 2026-3-28 10:26:30

r
0
huangliheng LV 7 @ 2025-5-24 19:43:52

#include<bits/stdc++.h> using namespace std; const int N=1e6+10; const int INF=0x3f3f3f3f; int ans,l,r,L,n,k,a[N]; bool check(int mid){ int sum=0; for(int i=2;i<=n;++i) sum+=(a[i]-a[i-1]-1)/mid; return sum<=k;
} int main(){ cin>>L>>n>>k; for(int i=1;i<=n;++i) cin>>a[i]; sort(a+1,a+n+1); r=a[n]-1; while(l<r){ int mid=(l+r)/2; if(check(mid)){ r=mid; } else l=mid+1; } cout<<r; return 0; }
-1
lijiakun2 LV 10 @ 2024-7-31 9:42:11

#include

#include

#include

#include

#include

#include

using namespace std;

const int N = 1e6 +10;

const int INF=0x3f3f3f;

int ans,l,r,L,n,k,a[N];

bool check(int mid){

int sum = 0;

for(int i = 2;i<=n;i++)

sum+=(a[i] - a[i-1] - 1) / mid;

return sum <= k;

}

int main(){

cin>>L>>n>>k;

for(int i = 1;i<=n;i++)

cin>>a[i];

sort(a+1,a+n+1);

r = a[n] - 1;

while(l<=r){

int mid = l + r >>1;

if(check(mid)){

ans = mid;

r = mid - 1;

}

else

l = mid + 1;

}

cout<<ans;

}