Cod sursa(job #1770645)
Utilizator | vladaa vlada | Data | 4 octombrie 2016 18:04:24 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[6000002],s[6000002];
int main()
{
int n,i,min,j,pozj,pozi,max;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
{fin>>a[i];
s[i]=s[i-1]+a[i];
}
min=0;
max=s[1];
j=0;
for(i=1;i<=n;i++)
{
if(s[i]-min>max)
{max=s[i]-min;
pozj=j;
pozi=i;}
if(s[i]<min)
{min=s[i];
j=i;
}
}
fout<<max<<" "<<pozj+1<<" "<<pozi;
return 0;
}