Submission #1319694

#TimeUsernameProblemLanguageResultExecution timeMemory
1319694g31niusMaxcomp (info1cup18_maxcomp)C++20
15 / 100
2 ms332 KiB
#include <iostream>
#include <cmath>

using namespace std;

long long i, j, x, y, s[1001][1001], n, m, maxi, poz;

int main() 
{
    cin >> n >> m;

    for ( i = 1; i <= n; i++ ) {
        for ( j = 1; j <= m; j++ ) {
            cin >> s[i][j];
        }
    }
    for ( i = 1; i <= n; i++ ) {
        for ( j = 1; j <= m; j++ ) {
            for ( x = 1; x <= n; x++ ) {
                for ( y = 1; y <= m; y++ ) {
                    if ( x != i || y != j ) {
                        poz = abs ( x-i );
                        poz += abs ( y-j );
                        maxi = max ( maxi, abs(s[i][j]-s[x][y])-poz-1);
                    }
                }
            }
        }
    }

    cout << maxi;
    
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...