Cod sursa(job #1416501)

Utilizator PaulDurlaAndronie safafasafs PaulDurla Data 8 aprilie 2015 10:16:20
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.93 kb
#include <fstream>
#include <cstring>
#define Max 6000000
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");

int a[Max],best[Max],n,i,bestSum,pozsbestSum,s=0,pozibestSum;
int main()
{
    /*int a[Max],best[Max],n,i,bestSum,pozsbestSum,s=0,pozibestSum=0;
    memset(best,0,sizeof(best));
    memset(a,0,sizeof(a));*/
    fin>>n;
    for(i=0;i<n;i++)
    {
        fin>>a[i];
    }
    bestSum = a[0];
    pozsbestSum=0;
    for(i=0;i<n;++i)
    {
        best[i]=a[i];
        if(best[i]<best[i-1]+a[i])
            best[i]=best[i-1]+a[i];
        if(bestSum<best[i])
            {
                bestSum=best[i];
                pozsbestSum=i;
            }
    }
    fout<<bestSum<<' ';
    for(i=pozsbestSum;i>=0;i--)
    {
        s=s+a[i];
        if(s==bestSum)
           {
            pozibestSum=i;
           }
    }
    fout<<pozibestSum+1<<' '<<pozsbestSum;
    return 0;
}