Cod sursa(job #336489)
| Utilizator | Data | 31 iulie 2009 16:58:14 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int max(int v1,int v2)
{
if (v1>v2)
{
return v1;
}
return v2;
}
ifstream fin;
ofstream fout;
int main()
{
fin.open("ssm.in");
fout.open("ssm.out");
int n,i,aux,st,end,be,b = -1,best = -999999;
fin >> n;
for (i=1;i<=n;i++)
{
fin >> aux;
if (b>=0)
{
b+=aux;
}
else
{
b = aux;
st = i;
}
if (b>best)
{
best = b;
end = i;
be = st;
}
}
fout << best << " " << be << " " << end;
fin.close();
fout.close();
return 0;
}