| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 157599 | RoundMango | 쌀 창고 (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 <bits/stdc++.h>
using namespace std;
long long a[10000005], sum[10000005], n, l = 1, r, md, mx, xx, ans;
//int besthub(int R, int L, int a[], long long b) {
int main() {
	int R, L, b;
	cin>>R>>L>>b;
	for (int i = 0; i < R; i++)
		cin>>a[i];
	for (int i = 1; i <= R; i++) 
		sum[i] = sum[i-1] + a[i-1];
	r = R;
	while (l < r) {
		ans = b+1;
		md = (l+r+1)>>1;
		for (int i = md; i <= R; i++) {
			n = i-md+1;
			mx = (i+n+1)>>1;
			xx = sum[i] - sum[mx] - (i-mx)*a[mx-1] + a[mx-1]*(mx-n) - sum[mx-1] + sum[n-1];
			ans = min(ans, xx);
		}
	    if (ans <= b) l = md;
		else r = md-1;
	}
	cout<<l;
}
