Submission #157600

#TimeUsernameProblemLanguageResultExecution timeMemory
157600RoundMangoRice Hub (IOI11_ricehub)C++14
100 / 100
20 ms2552 KiB
#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) {
	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;
	}
	return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...