Minimum Possible Value of Function

Walmart interviews coding interview problem: Given an integer sequence X, define F(k) as the sum of |X[i] − (k + i)| for i=1..N. Find the minimum possible value of F(k) over all integer k. This interview question focuses on evaluating a function over a shifted index and returning the minimal sum as a long integer.