Cod sursa(job #2579399)
| Utilizator | Data | 12 martie 2020 13:48:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int sumamax=-800000000, sumacrt, x, n, lungime, final, lungimemax;
int main() {
f >> n;
for (int i = 1; i <= n; i++) {
f >> x;
sumacrt += x;
lungime++;
if (sumacrt > sumamax)
{
final = i;
sumamax = sumacrt;
lungimemax = lungime;
}
if (sumacrt < 0)
{sumacrt = 0;
lungime = 0;}
}
g << sumamax << " " << final - lungimemax + 1 << " " << final;
f.close();
g.close();
return 0;
}
