poj 3565

题意：给定平面上的n个白点和n个黑点，要求用n条线段连接白点和黑点， 并且每一条线段不想交

分析：黑白点可看为二分图中的x集合和y集合，可得出当两个集合为最小圈匹配时一定满足条件

注意点：

1 因为这里求的是最小权值匹配，故w数组赋值为相反数， 然后求最大权值匹配即可

2 updtae()函数， 这里调了好久，lx[i] -= vis1[i] ? v : 0, ly[i] += vis2[i] ? v : 0;

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       

const int N = 100 + 5;
const double eps = 1e-10;

int n;
bool vis1[N], vis2[N];
int match[N], answer[N];
double lx[N], ly[N], w[N][N];
std::pair 
       
       
         a[N], b[N]; double get(int i, int j) { int x = a[i].first - b[j].first; int y = a[i].second - b[j].second; return sqrt(1.0 * x * x + 1.0 * y * y); } int dcmp(double x) { return fabs(x) < eps ? 0 : x > 0 ? 1 : -1; } bool dfs(int u) { vis1[u] = true; for (int i = 0; i < n; i ++) if (!vis2[i] && (dcmp(lx[u] + ly[i] - w[u][i]) == 0)) { vis2[i] = true; if (match[i] == -1 || dfs(match[i])) { match[i] = u; return true; } } return false; } void update() { double v = 1e10; for (int i = 0; i < n; i ++) if (vis1[i]) { for (int j = 0; j < n; j ++) if (!vis2[j]) { v = std::min(v, lx[i] + ly[j] - w[i][j]); } } for (int i = 0; i < n; i ++) { lx[i] -= vis1[i] ? v : 0; ly[i] += vis2[i] ? v : 0; } } void km() { for (int i = 0; i < n; i ++) { match[i] = -1; lx[i] = -1e10, ly[i] = 0; for (int j = 0; j < n; j ++) { lx[i] = std::max(lx[i], w[i][j]); } } for (int i = 0; i < n; i ++) { while (true) { std::fill(vis1, vis1 + n, false); std::fill(vis2, vis2 + n, false); if (dfs(i)) { break; } else { update(); } } } for (int i = 0; i < n; i ++) { answer[match[i]] = i; } for (int i = 0; i < n; i ++) { printf("%d\n", answer[i] + 1); } } void work() { for (int i = 0; i < n; i ++) { for (int j = 0; j < n; j ++) { w[i][j] = -get(i, j); } } km(); } int main() { while (scanf("%d", &n) == 1) { for (int i = 0; i < n; i ++) { int x, y; scanf("%d%d", &x, &y); a[i] = {x, y}; } for (int i = 0; i < n; i ++) { int x, y; scanf("%d%d", &x, &y); b[i] = {x, y}; } work(); } return 0; }