Submission #98085

#	Time	Username	Problem	Language	Result	Execution time	Memory
98085		SpeedOfMagic	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	33 ms	2552 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

int besthub(int R, int L, int X[], long long B) {
	long long pref[R];
	for (int i = 0; i < R; i++)
		pref[i] = (i ? pref[i - 1] : 0) + X[i];
	int l = 0, ans = 0;
	for (int r = 0; r < R; r++) {
		int med = (r - l) / 2 + l;
		long long cost = ((long long) X[med]) * (med - l + 1) - (pref[med] - pref[l] + X[l]);
		cost += pref[r] - pref[med] - ((long long) X[med]) * (r - med);
		
		if (cost > B) {
			l++;
			r--;
		} else
			ans = max(ans, r - l + 1);
	}
	return ans;
}

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