Pagini recente » Cod sursa (job #1250500) | Cod sursa (job #2465623) | Cod sursa (job #512476) | Cod sursa (job #447327) | Cod sursa (job #1092217)
#include <iostream>
#include <fstream>
using namespace std;
long long a[6000000],b[6000000],maxt,pm,s,i,n;
bool ok;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;maxt=-6545324;ok=true;
for (i=1;i<=n;i++)
{
f>>a[i];
if (a[i]>0) ok=false;
}
b[n]=a[n];
for (i=n-1;i>=1;i--)
{
if (a[i]+b[i+1]>a[i])
b[i]=a[i]+b[i+1];
else
if (a[i]==0)
b[i]=b[i+1];
else
{
b[i]=a[i];
pm=i;
}
}
for (i=1;i<=n;i++)
if (b[i]>maxt)
{
maxt=b[i];
s=i;
}
if (ok==false)g<<b[s]<<" "<<s<<" "<<pm;
else g<<b[s]<<" "<<s<<" "<<s;
return 0;
}