Pagini recente » Cod sursa (job #1803831) | Cod sursa (job #1113466) | Cod sursa (job #1155817) | Cod sursa (job #2213757) | Cod sursa (job #1946816)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long a[10001];
int main()
{
long max1=0,max2=0,i,n,st,dr,h,nr;
fin>>n;
for (i=1;i<=n;i++)
{
fin>>a[i];
h=a[i];
max1=max1+a[i];
if (max1<=0)
{
a[i]=0;
max1=0;
}
else
a[i]=max1;
if (max1>=max2)
{
dr=i;
max2=max1;
}
}
for (i=n;i>=1;i--)
{
nr=1;
while (a[i]!=0)
{
i--;
nr++;
}
st=i;
i=0;
}
fout<<max2<<" "<<st+1<<" "<<dr;;
return 0;
}