Cod sursa(job #2968592)
| Utilizator | Data | 21 ianuarie 2023 16:20:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int smax = 0, x, i = 1, imax = 1, j = 1, jmax, suma = 0, n;
f >> n;
while(j <= n)
{
f >> x;
suma = suma + x;
if(suma < 0)
{
i = j;
suma = 0;
}
if(smax < suma)
{
imax = i;
jmax = j;
smax = suma;
}
j++;
}
g << smax <<' '<< imax + 1 <<' '<< jmax;
return 0;
}
