Cod sursa(job #1130540)

Utilizator lucianRRuscanu Lucian lucianR Data 28 februarie 2014 13:54:29
Problema Subsecventa de suma maxima Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <iostream>
#include <fstream>
#define N_MAX 6000010

using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");

int n, s[N_MAX], sum[N_MAX], best[N_MAX], best_sum, imin, imax;

int main()
{
    in >> n;
    for(int i = 1; i <= n; i++)
    {
        in >> s[i];
        sum[i] = sum[i - 1] + s[i];
    }
    int smin = sum[0];
    for(int i = 2; i <= n; i++)
    {
        best[i] = sum[i] - smin;
        if(smin > sum[i]){ smin = sum[i]; imin = i + 1; }
        if(best[best_sum] < best[i]){ best_sum = i; imax = i; }
    }
    out << best[best_sum] << " " << imin << " " << imax;
    return 0;
}