← 返回 atlassian 的题目列表Optimal Cluster Center Placement
类型：online_judge
atlassian
Given an array of $n$ integers and an integer $k$, place $k$ cluster centers optimally to minimize the maximum L1 distance between any data point and its nearest cluster center. Return this minimized maximum distance.
Example
Input
[1, 2, 3, 4, 5], 2