摘要： 算法讲解：http://imlazy.ycool.com/post.1603708.htmldfs实现View Code 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 using namespace std; 5 int g[505][505],m[505],n[505],vist[505]; 6 int k,mm,gg,sum; 7 int search1(int i) 8 { 9 int j;10 for (j=1;j<=gg;j++)11 {12 if (g[i] 阅读全文