ACM_最大团
文章平均质量分 82
ACM_sjtsjt
不忘初心 追求美好
展开
-
hdoj 3585 maximum shortest distance(二分+最大团)
maximum shortest distanceProblem DescriptionThere are n points in the plane. Your task is to pick k points (k>=2), and make the closest points in these k points as far as possible. Inp原创 2016-02-13 04:03:39 · 762 阅读 · 0 评论 -
poj 2989 All Friends(Born_Kerbosch求极大团个数)
Born_Kerbosh算法个人感觉主要是判重精妙,最大团就是暴搜,谁都会,但求极大团个数的时候需要判重,自己想的时候怎么也想不出来怎么判,后来搜题解搜到了这个算法,发现网上关于这个算法的中文讲解几乎没有。。于是生硬的wiki上面的解释读了下来,附上链接https://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm#CITEREFJohn原创 2016-02-14 20:46:44 · 1172 阅读 · 0 评论 -
poj 1419(求最大独立集)
Graph ColoringDescriptionYou are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the only available colors are bla原创 2016-02-14 23:37:27 · 563 阅读 · 0 评论