摘要: 题意: n头公牛,m个仓库,每个公牛有一些自己喜欢的仓库,求每个公牛单独住进仓库的方案数。 题解: 状压dp,滚一维,两种写法,实测第一种写法要快些...... 滚掉第一维 include include include include include include define ll long 阅读全文
posted @ 2017-10-18 17:18 HLX_Y 阅读(141) 评论(0) 推荐(0) 编辑