| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 226406 | cfalas | Rice Hub (IOI11_ricehub) | C++14 | 29 ms | 2560 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;
#include "ricehub.h"
#define ll long long
#define MID ((l+r)/2)
int besthub(int n, int rr, int x[], long long b) {
	ll pre[n+1] = {};
	pre[0] = 0;
	for(int i=0;i<n;i++) pre[i+1] = pre[i] + x[i];
	ll ans=0;
	for(int i=0;i<n;i++){
		ll l=i;
		ll r=n-1;
		ll m, mm;
		while(l<=r){
			m = MID;
			ll mid = (i+m)/2;
			//cout<<"mdian: "<<x[mid]<<endl;
			//cout<<"sum before: "<<pre[mid]-pre[i]<<endl;
			ll c = (mid-i) * x[mid] - pre[mid]+pre[i];
			//cout<<"sum after: "<<pre[m+1]-pre[mid+1]<<endl;
			c+= pre[m+1]-pre[mid+1] - (m-mid) * x[mid];
			//cout<<i<< " "<<m<<" "<<c<<endl;
			if(c>b) r = m-1;
			else mm=m, l=m+1;
		}
		ans = max(ans,mm-i+1);
	}
	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... | ||||
