Cod sursa(job #1768276)

Utilizator Lungu007Lungu Ionut Lungu007 Data 30 septembrie 2016 16:59:06
Problema Subsecventa de suma maxima Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <fstream>
#define NMAX 6000002
using namespace std;

ifstream in("ssm.in");
ofstream out("ssm.out");

int a[NMAX],d[NMAX],n,sol,minim,sum[NMAX],x,si,sf;

int main()
{
    in >> n;

    for(int i=1;i<=n;i++)
    {
        in >> a[i];
        sum[i] =  sum[i-1] + a[i];
    }

     minim = 0;
    sol = a[0];
    d[0] = 0;
    for(int i=1;i<=n;i++)
    {
        d[i] = sum[i] - minim;

//   / cout << minim << " ";
        if(minim > sum[i])
        {

            minim = sum[i];
            x = i+1;
        }

        if(sol < d[i])
        {
            si = x;
            sf = i;
            sol = d[i];
        }
    }


    out << sol << " " << si << " " << sf;
    return 0;
}