Cod sursa(job #1625554)
| Utilizator | Data | 2 martie 2016 19:38:59 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMax = 6000005;
int N,X[NMax];
int Sol=-2000000000,Start,Finish;
void Read()
{
fin>>N;
for(int i = 1; i <= N; ++i)
fin>>X[i];
}
void Solve()
{
int i,j;
for(i = 1; i <= N; ++i)
{
int S = 0;
for(j = i; j <= N; ++j)
S += X[j];
if(S > Sol)
{
Sol = S;
Start = i;
Finish = j;
}
}
}
void Print()
{
fout<<Sol<<" "<<Start<<" "<<Finish<<"\n";
}
int main()
{
Read();
Solve();
Print();
return 0;
}
