Cod sursa(job #1648194)
| Utilizator | Data | 11 martie 2016 08:30:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int N, a[6000001], i, j, maxim = -2147483647, s, imaxim, jmaxim;
int main()
{
fin>>N;
for(i = 0; i < N; i++)
{
fin>>a[i];
}
j = 1;
for(i = 0; i < N; i++)
{
s += a[i];
if(s > maxim)
{
maxim = s;
imaxim = i + 1;
jmaxim = j;
}
if(s < 0)
{
s = 0;
j = i + 2;
}
}
fout<<maxim<<" "<<jmaxim<<" "<<imaxim;
fin.close();
fout.close();
return 0;
}
