Cod sursa(job #1483052)
| Utilizator | Data | 8 septembrie 2015 16:54:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.8 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMax = 6000005;
int X[NMax],N;
int main()
{
int Best = 0,Max = -2000000000,Start = 1,Begin,End;
fin>>N;
for(int i = 1; i <= N; ++i)
{
fin>>X[i];
if(X[i]+Best < X[i])
{
Best = X[i];
Start = i;
}
else
{
Best = X[i] + Best;
}
if(Best > Max)
{
Max = Best;
Begin = Start;
End = i;
}
}
fout<<Max<<" "<<Begin<<" "<<End<<"\n";
fin.close();
fout.close();
return 0;
}
