Cod sursa(job #1770663)
Utilizator | Data | 4 octombrie 2016 18:24:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
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=0;
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=a[i];
j=i;
}
}
fout<<max<<" "<<pozmin<<" "<<pozmax;
return 0;
}