제출 #224640

#제출 시각아이디문제언어결과실행 시간메모리
224640Amy313쌀 창고 (IOI11_ricehub)C++14
0 / 100
1098 ms768 KiB
#include "ricehub.h" #include<bits/stdc++.h> int besthub(int R, int L, int X[], long long B) { int maxi= -1, c, a; long long cp = B; for(int i=0; i<L; i++) { c = 0; cp = B; for(int j=0; j<R; j++) { a = abs(X[i]-X[j]); if(a<=cp) { cp-=a; c++; } else { break; } } if(c>maxi) { maxi = c; } } return maxi; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...