Cod sursa(job #1645370)
| Utilizator | Data | 10 martie 2016 12:06:14 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 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++)
{
S = 0;
for(j = i; j < N; j++)
{
S += s[j];
if(S > maxim)
{
imaxim = i;
jmaxim = j;
maxim = S;
}
}
}
fout<<maxim<<" "<<imaxim + 1<<" "<<jmaxim + 1;
return 0;
}
