Submission #719544

#TimeUsernameProblemLanguageResultExecution timeMemory
719544mseebacherRice Hub (IOI11_ricehub)C++17
0 / 100
1042 ms468 KiB
#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++){
		for(int j = 0;j<R;j++){
			int mid = (i+j) >> 1;
			long long cost = (long long)(mid-i)*x[mid]*1LL-pref[mid]-pref[i]; // Seg unten
			cost += (long long)pref[j+1]-pref[mid+1]-(j-mid)*x[mid]*1LL; // seg oben
			if(cost <= B) ans = max(ans,j-i+1);
		}
	}
  return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...