Cod sursa(job #1524834)
Utilizator | Horchidan Sonia-Florina SoniaFlorina | Data | 14 noiembrie 2015 14:49:11 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream in ("ssm.in");
ofstream out("ssm.out");
int n, v[6000000],minim=0,maxim=-INT_MAX,suma;
int main()
{ in>>n;
int i,prim,ultim,x=0;
for(i=1;i<=n;i++)
{in>>v[i];
suma+=v[i];
if(suma-minim>maxim)
{maxim=suma-minim;
prim=i;
ultim=x+1;}
else
if(suma<minim)
{minim=suma;
x=i;}
}
cout<<maxim<<' '<<prim<<' '<<ultim;
return 0;
}