Cod sursa(job #2668946)
Utilizator | Data | 5 noiembrie 2020 18:30:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out ("ssm.out");
int main()
{
int sc, smax, n, dr = 1 , st = 1, l = 0, p = 1;
in >> n;
sc = 0;
smax = -10000001;
for(int i = 1;i <= n; i++)
{
int x;
in >> x;
if(sc < 0)
{
sc = 0;
p = i;
}
sc += x;
if(sc > smax)
{
smax = sc;
dr = i;
st = p;
}
}
out << smax << " " << st << " " << dr;
in.close();
out.close();
return 0;
}