平面点曼哈顿最小生成树——POJ 3241 Object Clustering

最新推荐文章于 2021-08-13 12:45:30 发布

午后红茶馆

最新推荐文章于 2021-08-13 12:45:30 发布

阅读量1.7k

点赞数

分类专栏：树

本文链接：https://blog.csdn.net/u013351484/article/details/47425981

版权

对应POJ题目：点击打开链接

Object Clustering

Time Limit: 2000MS		Memory Limit: 131072K
Total Submissions: 1697		Accepted: 418

Description

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 d_ij = |a_i- a_j| + |b_i- b_j|, and then we say i is d_ij 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 d_ij ≤ X