Cod sursa(job #628799)
Utilizator | Negut Daniel Andrei danandrei | Data | 2 noiembrie 2011 10:06:29 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int a[6000010] ;
int main()
{
int i, Ri, Rj, Sum=0, N=0, R=0 ;
ifstream f("ssm.in") ;
ofstream g("ssm.out") ;
f>>N ;
for(i=1; i<=N ; i++) {
f>>a[i] ; }
for (i=1; i<=N; i++) {
Sum = Sum + a[i] ;
if(Sum<0) {
Sum=0 ;
Ri=i ; }
if(Sum>R) {
R=Sum ;
Rj=i ; }
}
g<<R<<" "<<Ri<<" "<< Rj;
return 0;
}