UVa10102 - The path in the colored field

#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cmath>

using namespace std;

const int N = 100 + 10;
const int INF = 0x3f3f3f3f;

string s[N];
int f[N][N];

int main()
{
    int m;

#ifndef ONLINE_JUDGE
    ifstream cin("uva_in.txt");
#endif

    while (cin >> m) {
        getline(cin, s[0]);
        for (int i = 0; i < m; i++) {
            getline(cin, s[i]);
        }        
        
        memset(f, 0x3f, sizeof(f));
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < m; j++) {
                if (s[i][j] == '1') {
                    for (int x = 0; x < m; x++) {
                        for (int y = 0; y < m; y++) {
                            if (s[x][y] == '3')
                                f[i][j] = min(f[i][j], abs(i - x) + abs(j - y));  
                        }
                    }
                }
            }
        }

        int ans = 0;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < m; j++) {
                if (s[i][j] == '1') {
                    ans = max(ans, f[i][j]);
                }
            }
        }

        cout << ans << endl;
    }
    return 0;
}