Cod sursa(job #2370184)
Utilizator | Data | 6 martie 2019 11:04:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int suma=-1, max1=-1, pozi, pozj, pi;
int n, x;
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
{
f >> x;
if (suma>=0) suma+=x;
else suma=x, pi=i;
if (suma>max1)
{
max1=suma;
pozi=pi;
pozj=i;
}
}
g << max1 << " " << pozi << " " << pozj;
return 0;
}