Location:
Search - whiteblackpoi
Search list
Description: 黑白点的匹配贪心算法
设平面上分布着n个白点和n个黑点，每个点用一对坐标（x, y）表示。一个黑点b=（xb,yb）支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw。若黑点b支配白点w，则黑点b和白点w可匹配（可形成一个匹配对）。在一个黑点最多只能与一个白点匹配，一个白点最多只能与一个黑点匹配的前提下，求n个白点和n个黑点的最大匹配对数。-black and white point matching greedy algorithm based on the distribution of a plane n n white spots and black spots. each point with a pair of coordinates (x, y). A black spots b = Page 205182 (xb and fro) a dominant white spots w = (xw, yw) if and only if xb
Platform: |
Size: 1024 |
Author: 陈馨 |
Hits: