Optimising DP using bitset in C++

Правка en1, от TimberLee, 2016-06-21 16:38:24

I recently read somewhere that some DP solutions like knapsack can be optimised and the overall complexity can be reduced by a factor of 32 using std::bitset in C++. Can somebody explain this optimisation and the kinds of DP on which this works ?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский TimberLee 2016-06-21 16:41:36 7 Tiny change: ' in C++.\nCan somebody explain t' -> ' in C++.\n\nCan someone explain t'
en1 Английский TimberLee 2016-06-21 16:38:24 280 Initial revision (published)