Cod sursa(job #956730)
| Utilizator | Data | 3 iunie 2013 19:43:02 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#define NMax 6000005
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N,X[NMax],Sol=-2000000000,Start,End;
void Read()
{
f>>N;
for(int i=1;i<=N;i++)
f>>X[i];
}
void Solve()
{
int i,begin,S=0;
for(i=1;i<=N;i++)
{
if(S+X[i]>X[i])
S+=X[i];
else
{
S=X[i];
begin=i;
}
if(S>Sol)
Sol=S,Start=begin,End=i;
}
}
void Print()
{
g<<Sol<<' '<<Start<<' '<<End<<'\n';
}
int main()
{
Read();
Solve();
Print();
return 0;
}
