MAX-GAP

For n+1 integers c1,c2,…cn, t the integer max gap problem is to answer whether there exists a permutation σ such that cσ(i) <= cσ(i+1) <= cσ(i)+t for all 1 <= i <= n.