当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3241:Object Clustering

题目描述

We have N (N ≤ 10000) objects, and wish to classify them into several groups by judgement of their resemblance. To simply the model, each object has 2 indexes a and b (a, b ≤ 500). The resemblance of object i and object j is defined by dij = |ai - aj| + |bi - bj|, and then we say i is dij resemble to j. Now we want to find the minimum value of X, so that we can classify the N objects into K (K < N) groups, and in each group, one object is at most X resemble to another object in the same group, i.e, for every object i, if i is not the only member of the group, then there exists one object j (i ≠ j) in the same group that satisfies dijX

输入解释

The first line contains two integers N and K. The following N lines each contain two integers a and b, which describe a object.

输出解释

A single line contains the minimum X.

输入样例
6 2
1 2
2 3
2 2
3 4
4 3
3 1
输出样例
2

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-3241

最后修改于 2020-10-29T06:56:37+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000 131072