读不懂的流年

Tempter of the Bone #include #include #include char s[104][104]; int n,m,k; int sx,sy; int di,dj,wall=0; struct tv { int x; int y; int number; } T[10010]; int bfs(int num,int sx,int sy

Fire Net #include #define N 5 using namespace std; int map[N][N],ans,m,n; bool visited[N][N],flag; void dfs(int s) { if(s==n*n) { if(ans<m) ans=m; return ; }

逃离迷宫 #include #include #include using namespace std; struct Node { int x; int y; }; int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}}; char map[102][102]; int m,n,step; int ok,sx,sy,ex,ey; int mark[

#include using namespace std; int w,h,n; char z[27][27]; int flag[27][27]; int dir[4][2]={{0,1},{1,0},{-1,0},{0,-1}}; void dfs(int x,int y) { int xx,yy,c; for(c=0;c<4;c++) { xx=x+d

#include #include using namespace std; int main() { int i,n; string s; while (cin>>s&&s != "0") { n = 0; for (i=0;i < s.length(); i++) { n += s[i] -'0'

广度优先搜索(Breadth-First-Search)和深度优先搜索(Deep－First－Search)是搜索策略中最经常用到的两种方法,特别常用于图的搜索.其中有很多的算法都用到了这两种思想,比如:Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想。 BFS的思想： 从一个图的某一个顶点V0出发，首先访问和V0相邻的且未被访问过的顶点V1、V2、

#include char a[105][105]; int n,m; using namespace std; int bfs(int x,int y) { int xx; int yy; a[x][y]='1'; for(int k=-1;k<2;k++) for(int l=-1;l<2;l++) { xx=x+k;

Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a poin