Pagini recente » Cod sursa (job #1587348) | Cod sursa (job #1800906) | Cod sursa (job #2401586) | Cod sursa (job #1949936) | Cod sursa (job #1095631)
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000005],i,n,j,v,m,b,e,beg[6000005],mini[6000005];
int main()
{
fin >> n;
m=-16000000;
for (i=1; i<=n; i++)
{
fin >> v;
s[i]=s[i-1]+v;
}
for (i=1; i<=n; i++)
{
mini[i]=6000000;
for (j=1; j<=i; j++)
{
if (s[i]-s[j-1]>s[i]-mini[i])
{
mini[i]=s[j-1];
beg[i]=j;
}
}
}
for (i=1; i<=n; i++)
{
if (s[i]-mini[i]>m)
{
m=s[i]-mini[i];
b=beg[i];
e=i;
}
}
fout << m << " " << b << " " << e;
fin.close();
fout.close();
return 0;
}