2021-03-12

矩阵算法

#include<bits/stdc++.h>
using namespace std;
int n,m,ans;
char arr[1001][1001];
int yong[1001][1001];
void df(int x,int y){
if(x-1>=1&&x-1<=n&&arr[x-1][y]!=arr[x][y]&&yong[x-1][y]==0)//shang
{
ans++;
yong[x-1][y]=1;
df(x-1,y);
}
if(x+1>=1&&x+1<=n&&arr[x+1][y]!=arr[x][y]&&yong[x+1][y]==0){//xia
ans++;
yong[x+1][y]=1;
df(x+1,y);
}
if(y-1>=1&&y-1<=n&&arr[x][y-1]!=arr[x][y]&&yong[x][y-1]==0){//zuo
ans++;
yong[x][y-1]=1;
df(x,y-1);
}
if(y+1>=1&&y+1<=n&&arr[x][y+1]!=arr[x][y]&&yong[x][y+1]==0){
ans++;
yong[x][y+1]==1;
df(x,y+1);
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cin>>arr[i][j];
}
}
int a[m+1],b[m+1];
for(int i=1;i<=m;i++)
cin>>a[i]>>b[i];
for(int i=1;i<=m;i++){
memset(yong,0,sizeof(yong));
ans=1;
yong[a[i]][b[i]]=1;
df(a[i],b[i]);
cout<<ans<<endl;
}
return 0;
}