Pagini recente » Cod sursa (job #1945438) | Cod sursa (job #1992431) | Cod sursa (job #2299747) | Istoria paginii runda/ojiiii | Cod sursa (job #1318299)
#include <fstream>
#define NMax 6000005
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int N,Sol=-2000000000,Begin,End;
int X[NMax],DP[NMax],Start;
void Read()
{
fin>>N;
for(int i=1;i<=N;i++)
fin>>X[i];
}
void Solve()
{
for(int i=1;i<=N;i++)
{
if(DP[i-1]+X[i]>=X[i])
{
DP[i] = DP [i-1] + X[i];
}
else
{
DP[i] = X[i];
Start = i;
}
if(DP[i]>Sol)
{
Sol = DP[i];
Begin = Start ;
End = i;
}
}
}
void Print()
{
fout<<Sol<<" "<<Begin<<" "<<End<<"\n";
}
int main()
{
Read();
Solve();
Print();
return 0;
}