Cod sursa(job #824970)
Utilizator | Data | 27 noiembrie 2012 11:28:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n , numar , p , a ,sm , c, maxim=-6000000 , i;
int main ()
{ f>>n;
for(i=1 ; i<=n ; ++i)
{ f>>numar;
if(sm<0)
{sm=0;
c=i;
}
sm=sm+numar;
if(sm>maxim)
{p=c;
a=i;
maxim=sm;
}
}
g<<maxim<<' '<<p<<' '<<a<<'\n';
g.close();
return 0;
}