Cod sursa(job #966673)
| Utilizator | Data | 26 iunie 2013 13:47:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, ind, inc, sfc, a, sum = 0, maxim = 0;
f >> n;
for ( int i = 1; i <= n; i++ )
{
f >> a;
if ( sum < 0 )
sum = a,
ind = i;
else
sum += a;
if ( maxim < sum )
maxim = sum,
inc = ind,
sfc = i;
}
g << maxim << " " << inc << " " << sfc << "\n";
}
