#include #include using namespace std;queue > Q;int arr[101][101];int visited[101][101];void BFS(int val);int a=0;int main(void){ cin>>a; for(int i=0; i>k; if(k=='R') { arr[i][j]=0; } else if(k=='G') { arr[i][j]=1; } else { arr[i][j]=2; } } } int count=0; for(int i=0; i-1) { visited[i-1][j]=1; Q.push(make_pair(i-1,j)); } if(arr[i][j+1]==val&&visited[i][j+1]=..