# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145023 | mhy908 | Rice Hub (IOI11_ricehub) | C++14 | 42 ms | 2936 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>
#include "ricehub.h"
using namespace std;
typedef long long LL;
LL sum[100010];
int arr[100010];
int ans=1;
int besthub(int n, int m, int x[], LL b)
{
int l=1, r;
LL p=0;
for(int i=0; i<n; i++)arr[i+1]=x[i];
for(int i=1; i<=n; i++)sum[i]=sum[i-1]+(LL)arr[i];
for(r=1; r<=n; r++){
while(l<=r){
int mid=(l+r)/2;
LL temp=(LL)(mid-l+1)*(LL)arr[mid]-(LL)(sum[mid]-sum[l-1])+(LL)(sum[r]-sum[mid-1])-(LL)(r-mid+1)*(LL)arr[mid];
if(temp<=b){
ans=max(ans, r-l+1);
break;
}
l++;
}
}
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... |