【算法笔记】数位DP

昨天以专题的形式再一次加强了数位DP
主要是以zky神犇的这一篇讲稿作为主线:
http://oi.cyo.ng/wp-content/uploads/2016/10/number_dp_by_zky.ppt

这一次最主要的收获就是学到了新的代码实现方式
之前一直是以预处理+询问的方式来写代码
这样的话,对于多组询问来讲,时间复杂度还不错
但代码实现复杂度简直没法接受
且对于部分题目,这样写起来会超级麻烦

新的写法无论实在时间复杂度还是编程复杂度上都很优越
以后应该会以这种代码作为主力辣!
给个参考:http://oi.cyo.ng/?p=1519

至于解题能力的话,似乎数位DP的要求不高?
不过能和AC自动机搞一起还是挺好玩哒:http://oi.cyo.ng/?p=1534

2 thoughts to “【算法笔记】数位DP”

  1. Howdy! I know this is somewhat off topic but I was wondering if you knew where I could locate a captcha plugin for my comment form? I’m using the same blog platform as yours and I’m having problems finding one? Thanks a lot!

Leave a Reply

Your email address will not be published. Required fields are marked *