You are viewing a single comment's thread. Return to all comments →
A better way of finding minBound and upperBound is as below( C++ ). I've passed all cases without TLE
double fac = 0; for(const long& mi : machines) fac += 1.0/mi; long minDay = goal/fac; long dayDiff = *max_element(machines.begin(), machines.end()); long maxDay = minDay + dayDiff;
Seems like cookies are disabled on this browser, please enable them to open this website
Minimum Time Required
You are viewing a single comment's thread. Return to all comments →
A better way of finding minBound and upperBound is as below( C++ ). I've passed all cases without TLE