Pagini recente » Cod sursa (job #1361653) | Istoria paginii autumn-warmup-2007/solutii/runda-3 | Cod sursa (job #206833) | Cod sursa (job #2786170) | Cod sursa (job #1640252)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000001], n;
void Citire()
{
int i;
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
}
int main()
{
int s, pr, smax, p, u, i;
Citire();
s=a[1]; pr=1;
smax=s;
p=u=1;
for(i=2; i<=n; i++)
{
if(s>0)
s+=a[i];
else { s=a[i]; pr=i; }
if(s>smax)
{
smax=s;
p=pr;
u=i;
}
else
if( s==smax && i-pr<u-p )
{
p=pr; u=i;
}
}
fout<<smax<<" "<<pr<<" "<<u;
fin.close();
fout.close();
return 0;
}