Cod sursa(job #503098)
| Utilizator | Data | 21 noiembrie 2010 14:27:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int main()
{
long n, i, a, s, max=0, re, re1=0;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
s=0;
if(n==1)
{
fin>>a;
fout<<a <<" "<<"1" <<" "<<"1";
return 0;
}
int st, dr;
long contor=0;
for(i=1;i<=n;++i)
{
fin>>a;
s+=a;
if(s>max)
{
max=s;
st=re;
dr=i;
}
if(s<0)
{
s=0;
re=i+1;
}
}
fout<<max<<" " <<st<<" " <<dr;
return 0;
}
