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