Cod sursa(job #1279989)
| Utilizator | Data | 1 decembrie 2014 12:17:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,sum =-int(2e9),M,N,nr,maxi,begin,begin2,finish;
int main()
{
fin >> n;
for(i = 1; i <= n; ++i)
{
fin >> nr;
if(sum < 0)
{
sum = nr;
begin = i;
}
else sum += nr;
if(maxi < sum)
{
maxi = sum;
begin2 = begin;
finish = i;
}
}
fout << maxi <<" "<< begin2 << " "<< finish;
return 0;
}
