Cod sursa(job #1098182)
| Utilizator | Data | 4 februarie 2014 16:48:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream is("ssm.in");
ofstream os("ssm.out");
int n,x;
int Sum;
int FP,LP,aux;
int main()
{
is >> n;
int bestsum(-99999);
for ( int i = 1; i <= n; ++i )
{
is >> x;
if ( Sum < 0 )
{
Sum = x;
aux = i;
}
else
Sum += x;
if ( Sum > bestsum )
{
bestsum = Sum;
FP = aux;
LP = i;
}
}
os << bestsum << " " << FP << " " << LP;
return 0;
}
