Pagini recente » Cod sursa (job #3193108) | Cod sursa (job #3229695) | Cod sursa (job #1883811) | Cod sursa (job #2356515) | Cod sursa (job #1866260)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMax = 6000005;
int X[NMax];
int N,A,B,Max = -2000000000;
int main()
{
int S = 0,Begin = 1;
fin >> N;
for(int i = 1; i <= N; ++i)
fin >> X[i];
for(int i = 1; i <= N; ++i)
{
if(S + X[i] >= X[i])
{
S = S + X[i];
}
else
{
S = X[i];
Begin = i;
}
if(S > Max)
{
Max = S;
A = Begin;
B = i;
}
}
fout << Max << " " << A << " " << B << "\n";
return 0;
}