Pagini recente » Cod sursa (job #1758868) | Cod sursa (job #1191006) | Cod sursa (job #1581129) | Cod sursa (job #1896684) | Cod sursa (job #1866247)
#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()
{
fin >> N;
for(int i = 1; i <= N; ++i)
fin >> X[i];
for(int i = 1; i <= N; ++i)
for(int j = i; j <= N; ++j)
{
int S = 0;
for(int k = i ; k <= j; ++k)
S = S + X[k];
if(S > Max)
{
Max = S;
A = i; B = j;
}
}
fout << Max << " " << A << " " << B << "\n";
return 0;
}