제출 #1162986

#제출 시각아이디문제언어결과실행 시간메모리
1162986HappyCapybaraRice Hub (IOI11_ricehub)C++17
100 / 100
8 ms800 KiB
#include "ricehub.h" #include<bits/stdc++.h> using namespace std; #define ll long long int besthub(int R, int L, int X[], ll B){ int cl = 0, cr = 0; ll cur = 0; for (int i=0; i<R; i++){ while (true){ if (cl == cr){ if (i-cl-1 >= 0 && cur + X[i] - X[i-cl-1] <= B){ cl++; cur += X[i]-X[i-cl]; } else break; } else { if (i+cr+1 < R && cur + X[i+cr+1] - X[i] <= B){ cr++; cur += X[i+cr]-X[i]; } else break; } } if (i+cr+1 >= R) break; cur -= X[i]-X[i-cl]; cur += (cl-cr)*(X[i+1]-X[i]); cur += X[i+cr+1]-X[i+1]; } return cl+cr+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...