Pagini recente » Cod sursa (job #1490061) | Cod sursa (job #2286673) | Cod sursa (job #447296) | Cod sursa (job #1222014) | Cod sursa (job #1770426)
#include <iostream>
#include <fstream>
using namespace std;
long long a[6000002],s[6000002];
int main()
{
int n,i,min,j,max,pozj,pozi;
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)
{min=s[i];
j=i;}
if(s[i]-min>max)
{max=s[i]-min;
pozj=j;
pozi=i;}
}
fout<<max<<" "<<pozj+1<<" "<<pozi;
return 0;
}