Pagini recente » Cod sursa (job #628834) | Cod sursa (job #2986439) | Produse | Cod sursa (job #2373250) | Cod sursa (job #1540335)
#include <fstream>
using namespace std;
int a[6000001],v[6000001],beg,end,maxim,inceput,sfarsit,i,n;
int main ()
{
ifstream f ("ssm.in");
ofstream g ("ssm.out");
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=n;i++)
{
if (v[i-1]<0)
{
v[i]=a[i];
inceput=i;
sfarsit=i;
}
else
{
v[i]=v[i-1]+a[i];
sfarsit=i;
}
if (v[i]>maxim)
{
maxim=v[i];
beg=inceput;
end=sfarsit;
}
}
g<<maxim<<" "<<beg<<" "<<end;
}