Cod sursa(job #1927507)

Utilizator mihailrazMihail Turcan mihailraz Data 15 martie 2017 09:48:06
Problema Subsecventa de suma maxima Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <iostream>
#include <deque>
#include <fstream>

using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
deque <int> d;
int n,i,S[6000001],s,st=1,dr=1,smaxi,inceput,sfarsit;
int X[6000000];
int main()
{
    fi>>n;
    for(i=1;i<=n;i++)
        fi>>S[i];
    s=X[st]+X[dr];
    for(st=1;st<=n;st++)
    {
        for(i=st;i<=n;i++)
        {
            s+=S[i];
            X[i]=s;
            if(s>smaxi)
            {
                smaxi=s;
                inceput=st;
                sfarsit=i;
            }
        }
        s=0;
    }
    fo<<smaxi<<' '<<inceput<<' '<<sfarsit;
    return 0;
}