Pagini recente » Cod sursa (job #976717) | Cod sursa (job #1836727) | Cod sursa (job #1752696) | Cod sursa (job #1770636) | Cod sursa (job #699538)
Cod sursa(job #699538)
#include <iostream>
#include <cstdio>
#include <queue>
#include <fstream>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
const int N=105;
int n,m,d[N][N];
struct punct
{
short int lin,col;
};
queue <punct> q;
const short int dlin[]={-1,-1,-1,0,1,1,1,0};
const short int dcol[]={-1,0,1,1,1,0,-1,-1};
int maxim(int d[N][N])
{
int max=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(d[i][j]>max)
max=d[i][j];
return max;
}
void lee()
{
punct x,y;
//q.push(x0);
//d[x0.lin][x0.col]=1;
while(!q.empty())
{
x=q.front();
q.pop();
for(int i=0;i<8;i++)
{
y.lin=x.lin+dlin[i];
y.col=x.col+dcol[i];
if(d[y.lin][y.col]==0)
{
d[y.lin][y.col]=1+d[x.lin][x.col];
q.push(y);
}
}
}
}
void bordare()
{
for(int i=0;i<=n+1;i++)
d[i][0]=d[i][m+1]=-1;
for(int j=0;j<=m+1;j++)
d[0][j]=d[n+1][j]=-1;
}
int main()
{
// freopen("rj.in","r",stdin);
// freopen("rj.out","w",stdout);
punct r,jul;
char x[N];
int i,j,max;
in>>n>>m;//fscanf(stdin,"%d",&n);
//fscanf(stdin,"%d",&m);
in.getline(x,N);//fgets(x,N,stdin);
for(i=1;i<=n;i++)
{
in.getline(x,N);//fgets(x,N,stdin);
for(j=0;j<m;j++)
{
// in>>x;
if(x[j]==' ')
d[i][j+1]=0;
if(x[j]=='X')
d[i][j+1]=-1;
if(x[j]=='R')
{
d[i][j+1]=1;
r.lin=i;
r.col=j+1;
q.push(r);
}
if(x[j]=='J')
{
d[i][j+1]=1;
jul.lin=i;
jul.col=j+1;
q.push(jul);
}
}
}
bordare();
lee();
max=maxim(d);
out<<max<<' ';//printf("%d ",max);
for( i=1 ; i<=n ; i++)
{
for( j=1 ; j<=m ; j++)
if(d[i][j]==max)
{
out<<i<<' '<<j;//printf("%d %d ",i,j);
return 0;
}
}
return 0;
}