Frez's blog

Max sum of subarrays for all sizes
By Frez, 9 years ago, In English

We have an array with size N from integers.

what is the best complexity of finding max sum of subarrays with size 1,2,3..,N ?

for example :

a = 1 4 4 2 5

s1 = 5

s2 = 8

s3 = 11

s4 = 15

s5 = 16

  • How about max/min single number or such interesting things ?

thanks.

  • Vote: I like it
  • +8
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Frez (previous revision, new revision, compare).

→ Reply
»
9 years ago, # |
  Vote: I like it +4 Vote: I do not like it

See this

→ Reply