Cod sursa(job #1675105)
| Utilizator | Data | 5 aprilie 2016 09:06:25 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
#define putin -10000000000
long long s, x, smax, index, fin, inc, n;
int main()
{
f >> n;
smax = putin;
for( int i = 1; i <= n; i ++ )
{
f >> x;
if( s < 0 )
{
s = x;
index = i;
}
else
{
s = s + x;
}
if( smax < s )
{
smax = s;
inc = index;
fin = i;
}
}
g << smax << " " << inc << " " << fin;
return 0;
}
