Cod sursa(job #1866251)
| Utilizator | Data | 2 februarie 2017 19:49:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#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)
{
int S = 0;
for(int j = i; j <= N; ++j)
{
S = S + X[j];
if(S > Max)
{
Max = S;
A = i; B = j;
}
}
}
fout << Max << " " << A << " " << B << "\n";
return 0;
}
