Cod sursa(job #1318303)
| Utilizator | Data | 15 ianuarie 2015 20:25:39 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.83 kb |
#include <fstream>
#define NMax 6000005
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int N,Sol=-2000000000,Begin,End;
int X[NMax],S,Start;
void Read()
{
fin>>N;
for(int i=1;i<=N;i++)
fin>>X[i];
}
void Solve()
{
for(int i=1;i<=N;i++)
{
if(S+X[i]>=X[i])
{
S = S + X[i];
}
else
{
S = X[i];
Start = i;
}
if(S>Sol)
{
Sol = S;
Begin = Start ;
End = i;
}
}
}
void Print()
{
fout<<Sol<<" "<<Begin<<" "<<End<<"\n";
}
int main()
{
Read();
Solve();
Print();
return 0;
}
