Pagini recente » Cod sursa (job #2772649) | Cod sursa (job #2535743) | Cod sursa (job #2457486) | Cod sursa (job #31853) | Cod sursa (job #678422)
Cod sursa(job #678422)
#include<algorithm>
#include<fstream>
#include<iostream>
using namespace std;
long n,a[6000011];
int main()
{
ifstream f("ssm.in");
ofstream g ("ssm.out");
int i;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
long suma=-int(2e9),inceput,sfarsit,poz,max=0;
for(i=1;i<=n;i++)
{ if(suma>=INT_MIN)
suma+=a[i];
else
{
suma=a[i];
poz=i;
}
if(suma>max)
{ max=suma;
inceput=poz;
sfarsit=i;
}
}
g<<max<<" "<<inceput<<" "<<sfarsit;
f.close();
g.close();
return 0;
}