Submission #62062

#TimeUsernameProblemLanguageResultExecution timeMemory
62062aomeRice Hub (IOI11_ricehub)C++17
0 / 100
6 ms636 KiB
#include "ricehub.h"

#include <bits/stdc++.h>

using namespace std;

int besthub(int R, int L, int X[], long long B) {
	int ptr = 0, res = 0;
	for (int i = 0; i < R; ++i) {
		while (ptr < R && 3LL * (X[ptr] - X[i]) <= 2 * B) ptr++;
		res = max(res, ptr - i);
	}
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...