Cod sursa(job #1095631)

Utilizator tziplea_stefanTiplea Stefan tziplea_stefan Data 31 ianuarie 2014 16:38:04
Problema Subsecventa de suma maxima Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<fstream>

using namespace std;

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

int s[6000005],i,n,j,v,m,b,e,beg[6000005],mini[6000005];

int main()
{
    fin >> n;
    m=-16000000;
    for (i=1; i<=n; i++)
    {
        fin >> v;
        s[i]=s[i-1]+v;
    }
    for (i=1; i<=n; i++)
    {
        mini[i]=6000000;
        for (j=1; j<=i; j++)
        {
            if (s[i]-s[j-1]>s[i]-mini[i])
            {
                mini[i]=s[j-1];
                beg[i]=j;
            }
        }
    }
    for (i=1; i<=n; i++)
    {
        if (s[i]-mini[i]>m)
        {
            m=s[i]-mini[i];
            b=beg[i];
            e=i;
        }
    }
    fout << m << " " << b << " " << e;
    fin.close();
    fout.close();
    return 0;
}