# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715575 | cbup | Rice Hub (IOI11_ricehub) | C++14 | 16 ms | 1492 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.
#include<bits/stdc++.h>
using namespace std;
long long findcost(int st,int en,int mid,vector<long long> &prefixSum,int *x){
return (mid-st)*x[mid]*1LL-(prefixSum[mid]-prefixSum[st]) + (prefixSum[en+1]-prefixSum[mid+1])-(en-mid)*x[mid]*1LL;
}
long long besthub(int n,int l,int x[],long long b){
long long cost,ans=1;
int mid,st,en,m,check = 0;
vector<long long> prefixSum(n+1,0);
st = en = 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 i=0;i<n;i++){
en = i;
mid = (st+en)/2;
cost = findcost(st,en,mid,prefixSum,x);
if(cost <= b){
ans = max(ans,en-st+1LL);
}
else{
while(findcost(st,en,mid,prefixSum,x) > b){
st++;
mid = (st+en)/2;
}
}
//cout<<st<<" "<<en<<" "<<cost<<endl;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |