Cod sursa(job #1811799)
Utilizator | Data | 21 noiembrie 2016 16:45:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, a[600001], i, j, in, sf;
int sum, mare=INT_MIN;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
{
fin>>a[i];
}
for(i=1;i<=n;++i)
{
if(sum<0)
{
sum=a[i];
j=i;
}
else
{
sum+=a[i];
}
if(mare<sum)
{
mare=sum;
in=j;
sf=i;
}
}
fout<<mare<<' '<<in<<' '<<sf;
return 0;
}