| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 843872 | ZeroCool | 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.
#include "ricehub.h"
#include <bits/stdc++.h>
#define ll long long
#define int long long
const int N = 100005;
using namespace std;
int pref[N];
int sum(int a,int b){
return pref[b] - pref[a-1];
}
int32_t besthub(int n, int l, int X[], int k){
int A[n+1];
for(int i = 1;i<=n;i++){
A[i] = X[i-1];
pref[i] = pref[i-1] + A[i];
}
int res = 0;
for(int i = 1;i<=n;i++){
int lo = i;
int hi = n;
while(lo <= hi){
int mid = (lo + hi)/2;
int x = (i + mid) /2 ;
int val = (A[x]*(x-i) - sum(i,x-1)) + (sum(x+1, mid) - A[x] * (mid-x));
if(val <= k){
res = max(res, mid - i + 1);
lo = mid + 1;
}else{
hi = mid - 1;
}
}
}
return res;
}
