- #1

- 8

- 0

My problem is to for a certain m find the combination/s which give/s me the max/min of S_m.

It can be done by calculating S_m for every combination, but this quickly amounts to a huge number of calculations, the most of course for m=n/2. I therefore probably need some algorithm for reaching the right combination.

Any ideas?