Submission #1027806

#TimeUsernameProblemLanguageResultExecution timeMemory
1027806vjudge1Rice Hub (IOI11_ricehub)C++17
17 / 100
1069 ms1884 KiB
#include <bits/stdc++.h> using namespace std; int besthub(int n, int L, int x[], long long b) { int l=0, r=n-1; while(r-l>1) { int mid=(r+l)/2; long long min_dist=LLONG_MAX; for(int i=0; i<=n-mid-1; i++) { int polovina=(i+i+mid)/2, kraj=i+mid; long long dist=0; for(int j=i; j<polovina; j++) { dist+=abs(x[j]-x[polovina]); } for(int j=polovina+1; j<=kraj; j++) { dist+=abs(x[j]-x[polovina]); } min_dist=min(dist, min_dist); } if(min_dist<=b) { l=mid; } else { r=mid; } } return r; } /*int main() { int r, l; long long b; cin>>r>>l; int x[r]; for(int i=0; i<r; i++) cin>>x[i]; cin>>b; cout<<besthub(r, l, x, b); return 0; }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...