제출 #496557

#제출 시각아이디문제언어결과실행 시간메모리
496557palilo쌀 창고 (IOI11_ricehub)C++17
0 / 100
2 ms500 KiB
#include <bits/stdc++.h> int besthub(int n, int _, int* a, long long b) { int ret = 0; for (int l = 0, r = 0; l < n; ++l) { for (; r != n && b >= 0; ++r) { b -= a[r] - a[(l + r) >> 1]; } ret = std::min(ret, r - l); b += a[(l + r) >> 1] - a[l]; } return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...