Cod sursa(job #2127837)
Utilizator | Andrei Boaca hhhhhhh | Data | 11 februarie 2018 09:34:46 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long int n,i,pozincep,pozfin,nrpoz,s;
long long int x;
long long int smaxim=-1;
int main()
{
fin>>n;
//fin>>x;
/*s=x;
if(s>smaxim)
smaxim=s;*/
pozincep=1;
pozfin=1;
for(i=1;i<=n;i++)
{
fin>>x;
if(s<0&&x>=0)
{
s=x;
pozincep=i;
}
else
s+=x;
if(s>smaxim)
{
smaxim=s;
pozfin=i;
}
}
fout<<smaxim<<" "<<pozincep<<" "<<pozfin;
return 0;
}