Cod sursa(job #563075)
| Utilizator | Data | 24 martie 2011 13:21:57 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <algorithm>
using namespace std ;
int n ;
int maxim=-1999999999 ;
int suma ;
int x ;
int pi=1 , pf ;
int main() {
freopen ("ssm.in","r",stdin) ;
freopen ("ssm.out","w",stdout) ;
scanf ("%d" , &n) ;
for (int i=1 ; i<=n ; ++i) {
scanf ("%d" , &x) ;
suma+=x ;
if (suma>=maxim) {
pf=i ;
maxim=suma ;
}
if (suma<0) {
suma=0 ;
pi=i+1 ;
}
}
printf ("%d %d %d" , maxim , pi , pf ) ;
return 0;
}
