Cod sursa(job #1189913)
| Utilizator | Data | 23 mai 2014 21:46:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 75 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, i, j, k, s, smax, x;
fin >> n;
fin >> x;
s = smax = x;
j = k = 1;
for (i = 2; i <= n; i++)
{
fin >> x;
if (s < 0)
{
k = i;
s = 0;
}
if (s > smax)
{
smax = s;
j = i-1;
}
s += x;
}
fout << smax << " " << k << " " << j;
return 0;
}
