Cod sursa(job #711428)
Utilizator | Data | 12 martie 2012 08:52:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 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;
}
}
if(max==0)
{fout<<"-1" <<" "<<"9" <<" " <<"9" ;return 0;}
fout<<max<<" " <<st<<" " <<dr;
return 0;
}