Cod sursa(job #1473928)

Utilizator Tomi98Osvath Tamas Tomi98 Data 20 august 2015 15:08:16
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <fstream>

using namespace std;
int n, v[101][101], s[101][101], rezultat, best = -101, rez = 0;
int main()
{
    ifstream f("joctv.in");
    ofstream g("joctv.out");
    f >> n;
    for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
    {
        f >> v[i][j];
        s[i][j] += s[i-1][j] + s[i][j-1] - s[i-1][j-1] + v[i][j];
    }
    for (int a = 1; a <= n; a++)
    for (int b = 1; b <= n; b++)
    {
        int mn = 0;
        int kMin = 0;
        for (int i = 1; i <= n; i++)
        {

            rez = s[b][i] - s[a-1][i] - mn;
            if (rez > best) best = rez;
            if (rez < mn )
            {
                mn = rez;
                kMin = i;
            }
        }

    }
    g << best;
    return 0;
}