제출 #582435

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

ricehub

#include <vector>
#include <iostream>

#define int long long
using namespace std;
int32_t besthub(int32_t n, int32_t L, int32_t X[], long long B){
	
	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) {
			cost -= 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