Cod sursa(job #1378450)
| Utilizator | Data | 6 martie 2015 12:17:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n, start, finish, pint;
int suma=0, x, maxim= -((1<<31)-1);
int main ()
{
in >> n;
for(int i=1; i<=n; i++)
{
in >> x;
if(suma < 0)
{
suma = x;
pint = i;
}
else suma += x;
if( maxim < suma)
{
maxim=suma;
start = pint;
finish = i;
}
}
out<<maxim<<' '<<start<<' '<<finish<<'\n';
return 0;
}
