Cod sursa(job #2607894)
| Utilizator | Data | 30 aprilie 2020 12:47:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std ;
ifstream in ("ssm.in") ;
ofstream out ("ssm.out") ;
int n , best = - ( 1 << 30 ) , x = 1 , y , X , Y , s , p ;
int main ()
{
in >> n ;
for ( int i = 1 ; i <= n ; ++ i )
{
in >> s ;
s += p ;
if ( s > best ) X = x , Y = i , best = s ;
if ( s < 0 ) s = 0 , x = i + 1 ;
p = s ;
}
out << best << ' ' << X << ' ' << Y ;
}
