Pagini recente » Cod sursa (job #780611) | Cod sursa (job #137251) | Cod sursa (job #1027349) | Cod sursa (job #2792208) | Cod sursa (job #2276125)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long n,a[6000001],st,dr,inc,maxim;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>a[i];
if(a[i]+a[i-1]>=0)a[i]+=a[i-1];
else
{
if(a[i]>=0)
{
inc=i;
}
}
if(a[i]>maxim)
{
maxim=a[i];
st=inc;
dr=i;
}
}
out<<maxim<<' '<<st<<' '<<dr;
return 0;
}