Cod sursa(job #572988)
Utilizator | Data | 5 aprilie 2011 19:46:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 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;}
long contor=0;
for(i=1;i<=n;++i)
{
fin>>a;
if(s==0)
re=i;
s+=a;
if(s>max){
max=s;
re1=i;
}
if(s<0){
s=0;
re1=0;
}
}
fout<<max<<" " <<re <<" " <<re1;
return 0;
}