Cod sursa(job #2906268)
| Utilizator | Data | 25 mai 2022 13:11:05 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream o("ssm.out");
int n, i, iit, in, sf, best = -(1e9), suma = 0, x;
f >> n;
for(i = 1; i <= n; ++i)
{
f >> x;
if(suma < 0)
{
iit = i;
suma = x;
}
else suma += x;
if(suma > best)
{
best = suma;
in = iit;
sf = i;
}
}
o << best << " " << in << " " << sf;
f.close();
o.close();
}
