Cod sursa(job #1786537)
| Utilizator | Data | 23 octombrie 2016 11:23:05 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <limits.h>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, s=0, best=LONG_MIN, idx, inceput, sfarsit, i, val;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>val;
if(s<0)
{
s=val;
idx=i;
}
else
s=s+val;
if(best<s)
{
best=s;
inceput=idx;
sfarsit=i;
}
}
fout<<best<<" "<<inceput<<" "<<sfarsit;
return 0;
}
