Cod sursa(job #698659)
Utilizator | Osiceanu Raoul osykuuu | Data | 29 februarie 2012 15:26:35 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
//Se citsete un sir de "n" nr intregi.Gasiti secventa de suma maxima a sirului
using namespace std;
int main()
{
int n,i,pc,x,sc,pozi,pozf,smax;
smax=(int)-2e9;
cin>>n;
pc=1;
sc=1;
for(i=1;i<=n;i++)
{ cin>>x;
if(x<0)
{ sc=x;
pc=i;
}
else
sc+=x;
if(sc>smax)
{
smax=sc;
pozi=pc;
pozf=i;
}
}
cout<<smax<<" "<<pozi<<" "<<pozf;
return 0;
}