Cod sursa(job #2683838)

Utilizator Maftei_TudorMaftei Tudor Maftei_Tudor Data 12 decembrie 2020 10:29:39
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.49 kb
#include <iostream>

using namespace std;
int v[6000001], dp[6000001], in[6000001], pozm;
int main()
{
    int n;
    cin>>n;
    for (int i=1; i<=n; i++)
        cin>>v[i];
    dp[1]=v[1];
    for (int i=2; i<=n; i++)
    {
        if (dp[i-1]<0) {in[i]=i; dp[i]=v[i];}
        else {in[i]=in[i-1]; dp[i]=dp[i-1]+v[i];}
    }
    pozm=1;
    for (int i=2; i<=n; i++)
    {
        if (dp[i]>dp[pozm]) pozm=i;
    }
    cout<<dp[pozm]<<' '<<in[pozm]<<' '<<pozm;
    return 0;
}