跳舞链
薄层
努力就有收获~
展开
-
HDU-5046 Airport(二分+DLX重复覆盖)
The country of jiuye composed by N cites. Each city can be viewed as a point in a two- dimensional plane with integer coordinates (x,y). The distance between city i and city j is defined by d ij = |x i - x j| + |y i - y j|. jiuye want to setup airport in K原创 2017-10-03 19:45:36 · 304 阅读 · 0 评论 -
DLX模板之精确覆盖和重复覆盖
给定一个n*m的矩阵,有些位置为1,有些位置为0。如果G[i][j]==1则说明i行可以覆盖j列。Problem:1)选定最少的行,使得每列有且仅有一个1.2)选定最少的行,使得每列至少一个1.原创 2017-10-03 15:33:11 · 914 阅读 · 0 评论