Cod sursa(job #3339288)

Utilizator piaaaaaaaioana praj piaaaaaaa Data 7 februarie 2026 12:15:28
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.65 kb
#include <bits/stdc++.h>
using namespace std;

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

int main() {
    int n, v[6000001], maxi = INT_MIN, s, i1 = 0, i2 = 0;
    
    fin >> n;
    
    for (int i = 1; i <= n; i++)
        fin >> v[i];
        
    s = v[1];
    
    for (int i = 2; i <= n; i++) {
        s = max(s + v[i], v[i])
    }

    for (int i = 1; i <= n; i++)
        if (maxi < s[i]) {
            maxi = s[i];
            i2 = i;
        }

    for (int i = i2; i >= 1; i--)
        if (i1 == 0 && s[i] == v[i])
            i1 = i;
            
    fout << maxi << " " << i1 << " " << i2;
    
    return 0;
}