fork download
  1. a = []
  2. n = 20
  3. for i in range(0, n):
  4. a.append(int(input()))
  5. S=a[1]
  6. L=1
  7. Lmax=0
  8. for i in range(2, n):
  9. if a[i]>a[i-1]:
  10. L+=1
  11. S+=a[i]
  12. else:
  13. if L>Lmax:
  14. Lmax=L
  15. Smax=S
  16. L=1
  17. S=a[i]
  18. if L>Lmax:
  19. Smax=S
  20. print(Smax)
  21.  
  22.  
Success #stdin #stdout 0.01s 27656KB
stdin
1
2
3
4
5
6
-5
-4
-3
-2
-1
0
45
13
14
15
0
17
12
19
24
stdout
30