Cod sursa(job #2577272)

Utilizator TUdOr73Minciunescu Tudor TUdOr73 Data 8 martie 2020 21:25:07
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.61 kb
#include <iostream>
#include <fstream>
using namespace std;
const int NMax = 6000000;
int v[NMax];
int T[NMax];
int main()
{   ifstream f("main.in");
    int n,start ,finish;
    f>>n;
    for(int i =1;i<= n;i++)
        f>>v[i];
    T[0] = -320000;
    int maxim  = T[0];
    for(int i = 1;i<= n;i++){
        if(T[i-1] + v[i]>v[i]){
            T[i] = T[i-1] + v[i];
            finish++;}
        else {T[i] = v[i];
            start = i;
            finish = i;}
        if(T[i] > maxim)
            maxim = T[i];
    }
    cout << maxim << " " << start << " "<< finish-1;
    return 0;
}