dark go attend motarack birthday Dark decide gift go Motarack array n nonnegative integersDark create array 1000 year ago element array disappear Dark know Motarack hate array adjacent element high absolute difference he do not time wants choose integer k 0 leq k leq 109 replace miss element array kLet m maximum absolute difference adjacent element ie maximum value a_i a_i1 1 leq leq n 1 array Dark replace miss element kDark choose integer k m minimize can help