Cod sursa(job #3344009)

Utilizator Boita_DavidBoita David Andrei Boita_David Data 28 februarie 2026 23:52:27
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <bits/stdc++.h>
using namespace std;

int v[1005], dp[1005];
ifstream in("ssm.in");
ofstream out("ssm.out");
int main(){
    int n;
    in >> n;
    for (int i = 1; i <= n; i++)
        in >> v[i];

    dp[1] = v[1];
     int ind = 1, lung = 0;
    for (int i = 2; i <= n; i++){
        if (dp[i - 1] + v[i] > v[i]){
            dp[i] = dp[i - 1] + v[i];
            lung++;
        }
        else {
            dp[i] = v[i];
            ind = i;
            lung = 0;
        }

    }
    out << dp[ind + lung -1] << " " << ind << " " << ind + lung - 1;
return 0;
}