Cod sursa(job #3309326)

Utilizator Andreea1112geoAndreea Bianca Georgescu Andreea1112geo Data 3 septembrie 2025 16:20:11
Problema Secventa 2 Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.66 kb
//var dinamica
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("ssm.in");
ofstream fout ("ssm.out");

int v[6000003], smax[6000003];
int main(){
    int n;
    fin >> n;
    for (int i = 1; i <= n; i++){
        fin >> v[i];
    }
    int best = v[1], st, dr, x=1;
    for (int i = 1; i <= n; i++){
        smax[i] = max(v[i], smax[i - 1] + v[i]);
        if (smax[i] == v[i] && smax[i-1]<0)
            x = i;
        if (smax[i] >= best){
            best = smax[i];
            st=x;
            dr = i;
        }
        best = max(best, smax[i]);
    }
    fout << best << " " << st << " " << dr;
    return 0;
}