Pagini recente » Cod sursa (job #1776997) | Cod sursa (job #2919085) | Cod sursa (job #2023127) | Cod sursa (job #3259715) | Cod sursa (job #2258524)
#include <fstream>
using namespace std;
int s=-9999999,bestsum=-9999999,n,a[6000001];
int k,start,en;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=n;i++)
{
if(s<0)
{
s=a[i];
k=i;
}
else
s+=a[i];
if(s>bestsum)
{
bestsum=s;
start=k;
en=i;
}
}
g<<bestsum<<" "<<start<<" "<<en;
f.close();
g.close();
return 0;
}