제출 #563310

#제출 시각아이디문제언어결과실행 시간메모리
5633101ne쌀 창고 (IOI11_ricehub)C++14
0 / 100
172 ms700 KiB
//#include "ricehub.h" #include<bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B) { int ans = 1; vector<int64_t>pref(R + 1,0),dpref(R + 1,0); for (int i = 0 ;i<R - 1;++i){ pref[i + 1] = pref[i] + (X[i + 1] - X[i]); dpref[i + 2] = pref[i + 1] + dpref[i + 1]; } //for (int i = 0;i<R;++i)cout<<dpref[i]<<" "; //cout<<'\n'; //1 3 18 - auto dist = [&](int l,int r){ return pref[r] * (r - l) - dpref[r] + dpref[l]<=B; }; for (int i = 0;i<R;++i){ for (int j = i + 1;j<R;++j){ if (dist(i,j))ans = max(ans,j - i + 1); //cout<<i<<" "<<j<<" "<<dist(i,j)<<'\n'; } } 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...