Submission #719581

#	Time	Username	Problem	Language	Result	Execution time	Memory
719581		mseebacher	Rice Hub (IOI11_ricehub)	C++17	68 / 100	17 ms	1492 KiB

ricehub

#include <bits/stdc++.h> 

using namespace std;

int besthub(int R, int L, int x[], long long B)
{
	vector<long long> pref(R+1,0);
	for(int i = 0;i<R;i++){
		pref[i+1] = pref[i]+x[i];
	}
	int ans = 0;
	for(int i = 0;i<R;i++){
		int l = i;
		int r = R-1;
		int j = 0;
		while(l<=r){
			j = (l+r)/2;
			int mid = (i+j) >> 1;
			long long cost = (long long)(mid-i+1)*x[mid]*1LL-(pref[mid+1]-pref[i]); // Seg unten
			cost += (long long)(pref[j+1]-pref[mid])-(j-mid+1)*x[mid]*1LL; // seg oben
			if(cost <= B) {
				ans = max(ans,j-i+1);
				l = j+1;
			}else r = j-1;
		}
	}
  return ans;
}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 0 / 32