Cod sursa(job #2083104)
| Utilizator | Data | 7 decembrie 2017 03:01:32 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
// ca la Savu
int n, a[6000002], suma, maxa, ifix; // viz[];
int main()
{
int i, j, st, dr;
f>>n;
for (i=1; i<=n; i++)
{
f>>j;
if (suma<0)
{
suma=j;
ifix=i;
}
else
suma+=j;
if (maxa<suma)
{
maxa=suma;
dr=ifix;
st=i;
}
}
g<<maxa<<" "<<dr<<" "<<st;
return 0;
}
