제출 #418224

#제출 시각아이디문제언어결과실행 시간메모리
418224temurbek_khujaev쌀 창고 (IOI11_ricehub)C++17
0 / 100
1074 ms444 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B) { int ans = 0; for (int i = 0; i < R; i++) { long long b = 0; for (int j = i; j > 0; j--) { b += X[i] - X[j]; for (int k = i; k < R; k++) { b += X[k] - X[i]; if ( b <= B) { ans = max(ans, k - j + 1); } } } } 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...