| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 715553 | vjudge1 | Rice Hub (IOI11_ricehub) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
int besthub(int n,int l,int x[],int b){
int cost,mid,mx_cost,ans;
vector<int> prefixSum(l,0);
for(int i=1;i<=n;i++)prefixSum[i] = prefixSum[i-1]+x[i-1];
//for(int i=1;i<=n;i++)cout<<prefixSum[i]<<" "; cout<<endl;
for(int st=1;st<=n;st++){
for(int en=st;en<=n;en++){
mid = (st+en)/2;
cost = (mid-st)*x[mid]-(prefixSum[mid-1]-prefixSum[st-1]) + (prefixSum[en]-prefixSum[mid])-(en-mid)*x[mid];
if(cost <= b)ans = max(ans,en-st+1);
//cout<<st<<" "<<en<<" "<<cost<<endl;
}
}
return ans;
}
