Pagini recente » Cod sursa (job #1550062) | Cod sursa (job #1602197) | Cod sursa (job #558819) | Cod sursa (job #1228025) | Cod sursa (job #1687649)
#include <iostream>
#include <fstream>
using namespace std;
int s[6000001];
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,max=-999999999,min=999999999,x,bestsum,pozin,pozfin,pozinit;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
}
min=s[1];
pozin=1;
for(i=1;i<=n;i++)
{
bestsum=s[i]-min;
if(bestsum>max)
{
max=bestsum;
pozinit=pozin;
pozfin=i;
}
if(s[i]<min)
{
min=s[i];
pozin=i+1;
}
}
fout<<max<<" "<<pozin<<" "<<pozfin;
return 0;
}