제출 #583045

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583045		Mystic03	쌀 창고 (IOI11_ricehub)	C++17	0 / 100	3 ms	340 KiB

ricehub

#include "ricehub.h"
#include <iostream>
#include <algorithm>

using namespace std;
int besthub(int R, int L, int X[], long long B)
{
	sort(X, X + R);
	int n = R;
	int from = 0;
	int to = 0;

	long long cost = 0;
	int res = 1;
	while (true) {
		int currRange = to - from + 1;
		to++;
		if (to >= n) break;

		int newDist = X[to] - X[to - 1];
		cost += (long long)currRange * newDist;

		while (cost > B) {
			if (from > to)  return 0;
			cost -= (long long)X[to] - X[from];
			from++;
		}

		res = max(res, to - from + 1);
	}
	
	return res;

}

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