Cod sursa(job #482220)
| Utilizator | Data | 2 septembrie 2010 20:22:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
int n, i, nr;
int p1, poz1, poz2;
int suma, suma_Max = -10000000000;
int main ()
{
ifstream f ("ssm.in");
ofstream g ("ssm.out");
f >> n;
for (i=1; i<=n; ++i)
{
f >> nr;
if (suma < 0)
{
suma = nr;
p1 = i;
}
else
suma += nr;
if (suma > suma_Max)
{
suma_Max = suma;
poz1 = p1;
poz2 = i;
}
}
g << suma_Max << " " << poz1 << " " << poz2 << "\n";
return 0;
}
