Consider Array A. For any suffix of A compute the prefix with maximum average.
Example : A => 1 3 2 5 3
Suffix [2, 5) => 2 5 3
Answer => 3.5
Is there a better solution than O(N ^ 2) ??
IMAN_GH's comment :
Haghani solved the problem and here we have his solution :
sum[i] = a + a + .. + a[i — 1]
for any i consider point (i, sum[i])
if answer for suffix i equals j then (sum[j] — sum[i]) / (j — i) is maximum in all j > i.
it's solution is somthing like upper hull of some points. it solves by using stack with insert points in the hull and updating it.
if we insert points from right to left then answer for suffix i equals to the second point in the upper hull after adding point i.