fork download 
  1. def main():
  2.     vec = [1, 2, 5, -4, 5, 6, -7, 1, -1, -7, 1, -10, 1, -3, 4]
  3.     print(vec)
  4.     i = 0
  5.     n = len(vec)
  6.     p = 1
  7.     smax = 0
  8.     while i < n:
  9.         while i < n and vec[i] <= 0:
  10.             i += 1
  11.         p = i
  12.         s = 0
  13.         while i < n and vec[i] >= 0:
  14.             s += vec[i]
  15.             i += 1
  16.         if s > smax:
  17.             smax = s
  18.             pmax = p
  19.             lmax = i - p
  20.     print("Position: ",pmax)
  21.     print("Summa:", smax)
  22.     print("Length: ",lmax)
  23. main()
  24.  
Success #stdin #stdout 0.02s 9080KB
comments (?)
stdin 
Standard input is empty
stdout 
[1, 2, 5, -4, 5, 6, -7, 1, -1, -7, 1, -10, 1, -3, 4]
Position:  4
Summa: 11
Length:  2
https://ideone.com/gq9dPT
Maximum Sum Consecutive
language:
Python 3 (python  3.9.5)
created:
2 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!