Pagini recente » Cod sursa (job #275310) | Cod sursa (job #1111420) | Cod sursa (job #3294702) | Cod sursa (job #637952) | Cod sursa (job #1478381)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMax = 6000005;
int X[NMax],N;
int main()
{
int Best = 0,Max = -2000000000,Start = 1,Begin,End;
fin>>N;
for(int i = 1; i <= N; ++i)
fin>>X[i];
for(int i = 1; i <= N; ++i)
{
if(X[i]+Best <= X[i])
{
Best = X[i];
Start = i;
}
else
{
Best = X[i] + Best;
}
if(Best > Max)
{
Max = Best;
Begin = Start;
End = i;
}
}
fout<<Max<<" "<<Begin<<" "<<End<<"\n";
return 0;
}