Cod sursa(job #2811775)
Utilizator | Data | 3 decembrie 2021 08:51:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <algorithm>
#define ll long long
#include <climits>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
int smax = INT_MIN, n, i, sc = -1, st, dr;
cin >> n;
int stc, drc;
for (i = 1; i <= n; i++)
{
int x;
cin >> x;
if (sc + x < x)
{
stc = i;
sc = x;
}
else sc += x;
drc = i;
if (sc > smax)
{
smax = sc;
st = stc;
dr = drc;
}
}
cout << smax << " " << st << " " << dr;
}