Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int m,mx=-6;
- int ar[21][21];
- bool check[21][21];
- int kx[4]={0,0,1,-1},
- ky[4]={1,-1,0,0};
- bool dfs(int x,int y){
- if(check[y][x]==true)
- return true;
- if(ar[y][x]>mx) mx=ar[y][x];
- check[y][x]=true;
- for(int k=0;k<4;k++){
- if(x+kx[k]>=1 && x+kx[k]<=m && y+ky[k]>=1 && y+ky[k]<=m ){
- if(check[y+ky[k]][x+kx[k]]==false && ar[y+ky[k]][x+kx[k]]!=100 && ar[y+ky[k]][x+kx[k]]>ar[y][x]){
- dfs(x+kx[k],y+ky[k]);
- }
- }
- }
- }
- int main(){
- int x,y;
- scanf("%d",&m);
- scanf("%d %d",&x,&y);
- for(int i=1;i<=m;i++){
- for(int j=1;j<=m;j++){
- scanf("%d",&ar[i][j]);
- }
- }
- dfs(x,y);
- printf("%d",mx);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement