Pagini recente » Cod sursa (job #2670830) | Cod sursa (job #1346140) | Cod sursa (job #2841351) | Cod sursa (job #2051056) | Cod sursa (job #2407731)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int a[6000005], s[6000005];
int main()
{
int sum=0, i, n, smax=-6000000, submin=6000000, in, sf, p=0;
f>>n;
for(i=1; i<=n; i++)
{
f>>a[i];
sum+=a[i];
s[i]=sum;
}
for(i=1; i<=n; i++)
{
if(s[i]-submin>s[i]) if(smax<s[i]-submin){smax=s[i]-submin; in=p; sf=i;}
else if(smax<s[i]){smax=s[i]; in=0; sf=i;}
if(submin>s[i]){submin=s[i]; p=i;}
}
g<<smax<<" "<<in+1<<" "<<sf;
return 0;
}