Cod sursa(job #1437370)

Utilizator DeehoroEjkoliPop Darian DeehoroEjkoli Data 17 mai 2015 15:50:59
Problema Subsecventa de suma maxima Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include <iostream>
#include <fstream>

using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int s[6000001], mx, mx1, mx2;
int main()
{
    int n;
    f >> n;
    for (int i = 1; i <= n; i++) {
        int x;
        f >> x;
        s[i] = s[i-1] + x;
    }
    for (int j = 1; j <= n; j++) {
        for (int i = 1 + j; i <= n; i++) {
            if (mx < s[i] - s[i-j]) {
                    mx = s[i] - s[i-j];
                    mx1 = i-j + 1;
                    mx2 = i;
            }
        }
    }
    g << mx << " " << mx1 << " " << mx2;
    return 0;
}