Cod sursa(job #1775954)
Utilizator | vladaa vlada | Data | 10 octombrie 2016 20:33:58 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[6000002];
int main()
{
int n,i,j=1,pozmin,pozmax,max=-999999999;
long long s=0;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
s=s+a[i];
if(s>max)
{
max=s;
pozmin=j;
pozmax=i;
}
if(s<a[i])
{
s=0;
j=i;
}
}
fout<<max<<" "<<pozmin<<" "<<pozmax;
return 0;
}