题出自啊哈算法P95
bfs算法
#include <iostream>
#include <queue>
using namespace std;
char a[100][100];
int book[100][100];
int sx,sy,n,m,dx,dy,res=0;
int inext[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};
struct node
{
int x,y;
};
void getsum(int x,int y)
{
int sum=0;
int i=x,j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G')
sum++;
i++;
}
i=x,j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G')
sum++;
i--;
}
i=x,j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G')
sum++;
j++;
}
i=x,j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G')
sum++;
j--;
}
if(sum>res)
{
res=sum;
dx=x,dy=y;
}
}
void bfs(int x,int y)
{
node head,tail;
head.x=x;
head.y=y;
queue<node> p;
p.push(head);
while(!p.empty())
{
head=p.front();
p.pop();
for(int k=0; k<4; k++)
{
tail.x=head.x+inext[k][0];
tail.y=head.y+inext[k][1];
if(tail.x<0||tail.x>n||tail.y<0||tail.y>m) continue;
if(a[tail.x][tail.y]=='.'&&book[tail.x][tail.y]==0)
{
book[tail.x][tail.y]=1;
p.push(tail);
getsum(tail.x,tail.y);
}
}
}
}
int main()
{
cin >> n >> m >> sx >> sy;
for(int i=0; i<n; i++)
for(int j=0; j<m; j++)
cin >> a[i][j];
bfs(sx,sy);
cout << '(' << dx << ',' << dy << ')' << endl;
cout << res ;
return 0;
}
dfs算法
#include <iostream>
#include <queue>
using namespace std;
char a[100][100];
int book[100][100];
int sx,sy,n,m,dx,dy,imax=0,num=0;
int inext[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};
int getsum(int x,int y)
{
int sum=0;
int i=x,j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G')
sum++;
i++;
}
i=x,j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G')
sum++;
i--;
}
i=x,j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G')
sum++;
j++;
}
i=x,j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G')
sum++;
j--;
}
return sum;
}
void dfs(int x,int y)
{
num=getsum(x,y);
if(num>imax)
{
imax=num;
dx=x,dy=y;
}
int tx,ty;
for(int k=0;k<4;k++)
{
tx=x+inext[k][0];
ty=y+inext[k][1];
if(tx<0||tx>n||ty<0||ty>m) continue;
if(a[tx][ty]=='.'&&book[tx][ty]==0)
{
book[tx][ty]=1;
dfs(tx,ty);
book[tx][ty]=0;
}
}
return ;
}
int main()
{
cin >> n >> m >> sx >> sy;
for(int i=0; i<n; i++)
for(int j=0; j<m; j++)
cin >> a[i][j];
dfs(sx,sy);
cout << '(' << dx << ',' << dy << ')' << endl;
cout << imax;
return 0;
}