P2960 [USACO09OCT] Invasion of the Milkweed G

今天博主为大家找到了这道题的代码，一共有两种解法供大家参考，希望大家多多点赞！（为dfs和bfs算法）

#include<bits/stdc++.h>
using namespace std;
char Map[105][105];
int n,m,l[8][2]={{1,0},{0,1},{-1,0},{0,-1},{1,1},{-1,-1},{1,-1},{-1,1}};
bool vis[105][105];
struct mmp
{
	int x,y,step;
}f,v;
queue <mmp> q; 
int bfs()
{
	int tot=0;
	f.step=0; q.push(f);
	while(!q.empty())
	{
		f=q.front();
		q.pop(); tot=max(tot,f.step);
		for(int i=0;i<8;i++)
		{
			v.x=f.x+l[i][0];
			v.y=f.y+l[i][1];
			v.step=f.step+1;
			if(v.x<1||v.x>n||v.y<1||v.y>m) continue;
			if(vis[v.x][v.y]) continue;
			if(Map[v.x][v.y]=='*') continue;
			q.push(v); vis[v.x][v.y]=1; 
		}
	}
	return tot;
}
int main()
{
	cin>>m>>n>>f.y>>f.x;
	vis[f.x][f.y]=1;
	for(int i=n;i>0;i--)
	 for(int j=1;j<=m;j++)
	  cin>>Map[i][j];
	cout<<bfs()<<endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N=102;
char ch[N][N];
int vis[N][N];
int m,n,my,mx;
int dx[]={0,0,1,-1,1,1,-1,-1};
int dy[]={1,-1,1,-1,0,-1,0,1};
struct node{
	int x,y;
	int step;
};
queue<node> q;
int dfs(int sx,int sy){
	vis[sx][sy]=1;
	node nod={sx,sy,0};
	q.push(nod);
	while(!q.empty()){
		nod=q.front();
		q.pop();
		for(int i=0;i<8;i++){
			int nx=nod.x+dx[i];
			int ny=nod.y+dy[i];
			int step=nod.step+1;
			if(nx<1||nx>n||ny<1||ny>m) continue;
			if(vis[nx][ny]) continue;
			if(ch[nx][ny]=='*') continue;
			vis[nx][ny]=1;
			node nnod={nx,ny,step};
			q.push(nnod);
		}
	}
	return nod.step;
}
int main(){
	scanf("%d %d %d %d",&m,&n,&my,&mx);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>ch[i][j];
		}
	}
	int res=dfs(n+1-mx,my);
	printf("%d\n",res);
 
	return 0;
}

大家多多点赞哦！！