0
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?

More than 1 year has passed since last update.

bit dp

Last updated at Posted at 2022-03-31

巡回セールスマン問題
dp[bit][最後に訪れた頂点] = 最短経路

シフト制
dp[bit][日数] = パターン数

1次元 bit dp
dp[bit] = 最小個数

0
0
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
0
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?