제출 #62061

#제출 시각아이디문제언어결과실행 시간메모리
62061aome쌀 창고 (IOI11_ricehub)C++17
0 / 100
5 ms740 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 && 3 * (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...