Help in the bipartite Dp problem from atcoder

Правка en2, от vipin_bhardwaj, 2019-06-20 18:53:37

Given a sequence (1, 2, 3, ... N) and an integer k. You need to find all the permutations of the sequence such that for any i in the permutation |a_i — i| != k

problem link

N <= 2000 and k < n

from the given editorial i am not able to understand how to find Mk using DP.
Can someone please help. Thank you

Теги #permutation, #dp, biparite matching


  Rev. Язык Кто Когда Δ Комментарий
en2 Английский vipin_bhardwaj 2019-06-20 18:53:37 68
en1 Английский vipin_bhardwaj 2019-06-20 18:52:46 405 Initial revision (published)