Dp or greedy?

Правка en1, от jlsxly, 2022-11-12 10:14:45

Here is a sequence with n integers in it. Each of the integers is 1 or -1.

You have to rearrange the sequence, to get the maximum interval sum to be MINIMUM.

I would like to know how many arrangements there are.

Теги maths

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский jlsxly 2022-11-12 10:14:45 230 Initial revision (published)