Cod sursa(job #1051229)
| Utilizator | Data | 9 decembrie 2013 20:53:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int N;
int ii;
int sum, b, e;
int maxim;
int main()
{
fin >> N;
maxim = -0x3f3f3f3f;
ii = 1;
for (int i = 1, nr; i <= N; ++i)
{
fin >> nr;
if (sum + nr >= nr) sum += nr;
else
{
ii = i;
sum = nr;
}
if (sum > maxim)
{
maxim = sum;
b = ii;
e = i;
}
}
fout << maxim << ' ' << b << ' ' << e;
fin.close();
fout.close();
return 0;
}
