| ||||||||||
Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Announcement | Current Contest Past Contests Scheduled Contests Award Contest |
Object Clustering
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 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 dij ¡Ü X Input The first line contains two integers N and K. The following N lines each contain two integers a and b, which describe a object. Output A single line contains the minimum X. Sample Input Sample Output Source |
[Submit] [Go Back] [Status] [Discuss]
All Rights Reserved 2003-2007 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator