Pagini recente » Cod sursa (job #2142640) | Cod sursa (job #2420637) | Cod sursa (job #2530098) | Cod sursa (job #651620) | Cod sursa (job #282315)
Cod sursa(job #282315)
#include<iostream.h>
#include<fstream.h>
long b[6000001],n;
ifstream f("ssm.in");
ofstream h("ssm.out");
void citire()
{f>>n; long i;
for(i=1;i<=n;i++)
f>>b[i];
}
void lini()
{
long bestSum = b[1], min = 0,i,id,jd,idx;
for (i = 1; i <= n; ++ i)
{
b[i] += b[i - 1];
if (bestSum < b[i] - min)
{ bestSum = b[i] - min ;id=idx+1;jd=i;}
if (min > b[i])
{min = b[i];idx=i;}
}
h<<bestSum<<" "<<id<<" "<<jd;
}
int main()
{citire();
lini();
return 0;
}