Submission #719542

#	Time	Username	Problem	Language	Result	Execution time	Memory
719542		mseebacher	쌀 창고 (IOI11_ricehub)	C++17	0 / 100	526 ms	632 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 = 1;i<=R;i++){
		for(int j = i+1;j<=R;j++){
			int mid = (i+j) >> 1;
			long long cost = (long long)(mid-i+1)*x[mid]-pref[mid]-pref[i-1]; // Seg unten
			cost += (long long)pref[j]-pref[mid]-(j-mid)*x[mid]; // seg oben
			if(cost <= B) ans = max(ans,j-i+1);
		}
	}
  return ans;
}

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