제출 #286481

#제출 시각아이디문제언어결과실행 시간메모리
286481Ruba_KRice Hub (IOI11_ricehub)C++14
42 / 100
1090 ms640 KiB
#include "ricehub.h" #include<bits/stdc++.h> using namespace std ; vector<int>v; long long mx , l; bool ok(int md){ long long sum = 0 , mn = 1e18 ; int sz = v.size(); for(int i = 0 ; i <= sz - md ; i ++){ for(int j = i ; j < i + md ; j ++){ for(int c = i ; c < md + i ; c ++){ sum += abs(v[j] - v[c]); } mn = min(mn , sum); sum = 0 ; } //B : continue ; if(mn <= mx)return true ; } return false ; }/* 5 20 6 1 2 10 12 14 3 */ int besthub(int R, int L, int X[], long long B) { mx = B ;l = L ; // vector<int>v; for(int i = 0 ; i < R ; i ++) v.push_back(X[i]); int l = 0 , r = R , md ; while(l < r){ md = (l + r + 1) / 2 ; if(ok(md))l = md ; else r = md - 1 ; } return l ; return R; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...