Cod sursa(job #1687662)

Utilizator leraValeria lera Data 13 aprilie 2016 00:03:12
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <iostream>
#include <fstream>
using namespace std;
int s[6000001];
int main()
{
    ifstream fin("ssm.in");
    ofstream fout("ssm.out");
    int n,i,max=-999999999,min=0,x,bestsum,pozin,pozfin,pozinit;
    fin>>n;
    s[0]=0;
    for(i=1;i<=n;i++)
        {
            fin>>x;
            s[i]=s[i-1]+x;
        }
    pozin=1;
    for(i=1;i<=n;i++)
    {

        if(s[i]<min)
        {
            pozin=i+1;
        }
            bestsum=s[i]-s[pozin-1];
            if(bestsum>max)
            {
                max=bestsum;
                pozinit=pozin;
                pozfin=i;
            }

    }
    fout<<max<<" "<<pozin<<" "<<pozfin;

    return 0;
}