Pagini recente » Cod sursa (job #3292632) | Cod sursa (job #3289416) | Cod sursa (job #2760280) | Cod sursa (job #3150793) | Cod sursa (job #1497753)
#include <fstream>
using namespace std;
ifstream fi ("ssm.in");
ofstream fo ("ssm.out");
int a[6000007],b[6000007],i,n,s,maxi,posf,posi;
int main()
{
fi>>n;
for (i=1;i<=n;i++) fi>>a[i];
for (i=1;i<=n;i++)
{
s=s+a[i];
if (s>=0) b[i]=s;
else {s=0;b[i]=-1;}
if (s>maxi) maxi=s;
}
for (i=1;i<=n;i++) fo<<b[i]<<' ';
for (i=1;i<=n;i++)
{
if (maxi==b[i]) {posf=i;break;}
}
for (i=posf;i>=1;i--)
{
if (b[i]==-1) {posi=i+1;break;}
}
fo<<'\n';
fo<<maxi<<' '<<posi<<' '<<posf;
return 0;
}