|
|
back to boardHuuh! I've AC! Posted by PSV 26 Oct 2006 06:15 First DP formula like 1 + min max (a[i - 1, k-1], a[n - i,k ]) is NOT GOOD! In pascal it gets TLE! Take more clever formula!!! Re: Huuh! I've AC! You can simply optimize this formula, assuming that min and max are convex functions. Re: Huuh! I've AC! Posted by ASK 28 Mar 2010 17:26 or binary search the intersection of (e eggs, f-th floor) #define T1(i) c[e][(i)-1] #define T2(i) c[e-1][f-(i)] Re: Huuh! I've AC! Posted by Liol 19 Feb 2022 11:50 GOOD |
|
|