POJ 3565 Ants(计算几何,KM)(二)

2014-11-24 10:52:30 · 作者: · 浏览: 1
!=EOF){
for(int i=0;i scanf("%lf%lf",&ant[i].x,&ant[i].y);
for(int i=0;i scanf("%lf%lf",&tree[i].x,&tree[i].y);
memset(path,0,sizeof(path));
for(int i=0;i for(int j=0;j
path[i][j]=dist(tree[i],ant[j]);
km();
for(int i=0;i printf("%d\n",match[i]+1);
}
return 0;
}