Cod sursa(job #2125423)
Utilizator | Andrei Boaca hhhhhhh | Data | 8 februarie 2018 14:25:55 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,s[100001],i,x,j,pozincep,pozfin,maxim=-9999,minim=99999999;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
if(s[i]<minim)
{
minim=s[i];
pozincep=i+1;
}
if(s[i]>=maxim)
{
maxim=s[i];
pozfin=i;
}
}
fout<<s[pozfin]-s[pozincep-1]<<pozincep<<" "<<pozfin;
return 0;
}