Pagini recente » Cod sursa (job #381675) | Cod sursa (job #685985) | Cod sursa (job #3005550) | Cod sursa (job #1143506) | Cod sursa (job #1642117)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMax = 6000005;
int X[NMax],DP[NMax];
int N,Sol=-2000000000,Start,Finish;
void Read()
{
fin>>N;
for(int i = 1;i <= N; ++i)
fin>>X[i];
}
void Solve()
{
int Begin = 1;
for (int j = 1; j <= N; ++j)
{
if(DP[j-1] + X[j] >= X[j])
{
DP[j] = DP[j-1] + X[j];
}
else
{
DP[j] = X[j];
Begin = j;
}
if(DP[j] > Sol)
{
Sol = DP[j];
Start = Begin;
Finish = j;
}
}
}
void Print()
{
fout<<Sol<<" "<<Start<<" "<<Finish<<"\n";
}
int main()
{
Read();
Solve();
Print();
return 0;
}