Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.

UPCOMING CHALLENGES:

CURRENT CHALLENGES:

Neon 2014

PAST CHALLENGES

Fluorum 2014

Oxygenium 2014

Nitrogenium 2013

Carbo 2013

Boron 2013

Beryllium 2013

Lithium 2013

Helium 2013

Hydrogenium 2013

Omega 2013

Psi 2012

Chi 2012

Phi 2012

Upsilon 2012

Tau 2012

Sigma 2012

Rho 2012

Pi 2012

Omicron 2012

Xi 2012

Nu 2011

Mu 2011

Lambda 2011

Kappa 2011

Iota 2011

Theta 2011

Eta 2011

Zeta 2011

Epsilon 2011

Delta 2011

Gamma 2011

December 2010

PrefixSet edition (2010-10)

Two non-empty arrays A and B, each consisting of N integers, are given. Four functions are defined based on these arrays:

F(X,K) = A[K]*X + B[K] U(X) = max{ F(X,K) : 0 ≤ K < N }D(X) = min{ F(X,K) : 0 ≤ K < N }S(X) = U(X) − D(X)

Write a function:

class Solution { public double solution(int[] A, int[] B); }

that, given two arrays A and B consisting of N integers each, returns the minimum value of S(X) where X can be any real number.

For example, given the following arrays A and B consisting of three elements each:

the function should return 0.5 because:

U(X) = −1*X + 3 if X ≤ 1 U(X) = 0*X + 2 if 1 ≤ X ≤ 2 U(X) = 1*X + 0 if 2 ≤ X

and:

D(X) = 1*X + 0 if X ≤ 1.5 D(X) = −1*X + 3 if 1.5 ≤ X

so for X = 1.5, function S(X) is equal to 0.5 and this is the minimum value of this function.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [1..100,000];
- each element of arrays A and B is an integer within the range [−1,000..1,000].