ural 1869

简单题 ~~ 

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

int a[110][110], _max;
void cood(int n)
{
    int sum = 0;
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j < i; j ++)
            sum -= a[j][i];
        for(int j = i+1; j <= n; j ++)
        {
            sum += a[i][j];
        }
        _max = max(_max, sum);
    }
}
void res(int n)
{
    for(int i = 1; i <= n; i ++)
        for(int j = i+1; j <= n; j ++)
        {
            int tem = a[i][j];
            a[i][j] = a[j][i];
            a[j][i] = tem;
        }
}
int main()
{
    int n;
    scanf("%d", &n);
    _max = 0;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++)
            scanf("%d",&a[i][j]);
    cood(n);
    res(n);
    cood(n);
    printf("%d\n", _max%36 == 0 ? _max/36:_max/36+1);
    return 0;
}

转载于:https://www.cnblogs.com/avema/p/3774198.html