Submission #418245

#TimeUsernameProblemLanguageResultExecution timeMemory
418245AzimjonRice Hub (IOI11_ricehub)C++17
0 / 100
4 ms332 KiB
#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

int besthub(int R, int L, int X[], long long B) {
	auto cost = [&](int x, int y) { return abs(X[x] - X[y]); };

	int ans = -1;

	for (int i = 0; i < R; i++) {
		int cans = 0;
		long long cb = B;
		for (int j = i; j < R; j++) {
			if (cb - cost(i, j) >= 0) {
				cb -= cost(i, j);
			} else {
				break;
			}
			cans++;
		}

		ans = max(cans, ans);
	}

	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...