请教一个数组题# JobHunting - 待字闺中
c*0
1 楼
Given a sorted array of n integers, pick up k elements so that the minimal
difference between consecutive elements is maximal (that is choose the
elements to maximize the quantity min(a[i+1] - a[i]))
difference between consecutive elements is maximal (that is choose the
elements to maximize the quantity min(a[i+1] - a[i]))