| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 963115 | Amr | Race (IOI11_race) | C++17 | 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>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define sz size()
const int N = 1000;
ll pre[N];
int besthub(int R, int L, int X[], long long B)
{
ll l = 1, r = R+1;
for(int i = 0; i < R; i++) pre[i+1] = pre[i]+X[i];
while(l+1<r)
{
ll mid = (l+r)/2;
for(int i = mid-1; i < R; i++)
{
ll po = i-mid/2;
ll res = pre[i+1]-pre[po-1+1]-((mid+1)/2)*X[po+1]+(mid/2)*X[po+1]-(pre[po-1+1]-pre[i-mid+1]);
if(res<=B) l = mid; else r = mid;
}
}
return l;
}