coding__girl的博客

The gopher family, having averted the canine threat, must face a new predator. The are n gophers and m gopher holes, each at distinct (x,y) coordinates. A hawk arrives and if a gopher does not reach a

The number of students interested to participate in this year’s Intra-BUET Programming Contest is huge. Since it is very difficult to accommodate such a large number of students in our labs, we have de

匈牙利算法，将狗的兴趣点与人走的每段路作二部图（即图的左边是点，右边是边），求出该二部图对于狗的兴趣点的最大匹配数，再加上人必经的点数，就是狗的路线。#include <iostream> #include <cmath> #include <vector> #include <cstring> using namespace std; const int Maxn=105; int N,M; do