Fibonacci Optimum Method

This program is to find the maximal point by using Fibonacci optimum method.
The corresponding C++ code is shown at the bottom.

We assume the target curve is F(x) = -a*(x-x1)*(x-x2).
And the region is (b1, b2).

Input the a, x1 and x2 (>=0 and <=1000):
a =
x1 =
x2 =

Input the b1 and b2 (0=< b1 <= b2 <=1000):
b1 =
b2 =




The maximal point is: