Cod sursa(job #2186106)

Utilizator rnqftwcalina florin daniel rnqftw Data 25 martie 2018 12:44:06
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include<bits/stdc++.h>

using namespace std;
int best[6000000],a[6000000];
int main(){
    int n;
    int i;
    int beg,end1,it;
    cin>>n;
    for (i = 1; i <= n; ++ i)
            cin>>a[i];
    int bestSum = a[1];

    for (i = 1; i <= n; ++ i) {
        if (best[i] < best[i-1] + a[i]){
            best[i] = best[i-1] + a[i];

        }
        else{
            best[i]=a[i];
            it=i;
        }
        if (bestSum < best[i]){
            bestSum = best[i];
            beg=it;
            end1=i;
        }
    }

    cout<<bestSum<<" "<<beg<<" "<<end1;
}