Pagini recente » Cod sursa (job #2319078) | Cod sursa (job #2301025) | Cod sursa (job #1544388) | Cod sursa (job #35981) | Cod sursa (job #1497756)
#include <fstream>
using namespace std;
ifstream fi ("ssm.in");
ofstream fo ("ssm.out");
long long a[6000007],b[6000007],i,n,s,maxi,posf,posi;
int main()
{
maxi=-20000000000;
fi>>n;
for (i=1;i<=n;i++) fi>>a[i];
for (i=1;i<=n;i++)
{
s=s+a[i];
if (s>maxi) maxi=s;
if (s>=0) b[i]=s;
else {s=0;b[i]=-1;}
}
// for (i=1;i<=n;i++) fo<<b[i]<<' ';
if (maxi>0){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;}}
else
{
for (i=1;i<=n;i++)
if (a[i]==maxi) {posi=i;posf=i;break;}
}
// fo<<'\n';
fo<<maxi<<' '<<posi<<' '<<posf;
return 0;
}