随笔分类 - 动态规划_状压DP
摘要:P2831 愤怒的小鸟 从 (0,0) 发射一只鸟, 轨迹满足抛物线, 问最少几只鸟可以打完 $n include include include include include include define LL long long define REP(i, x, y) for(int i
阅读全文
摘要:P1171 售货员的难题 题目描述 某乡有nn个村庄(1 all 1路径总长度最小调试日志:又把1 include include include include include define LL long long define REP(i, x, y) for(int i = (x
阅读全文
摘要:P3052 [USACO12MAR]摩天大楼里的奶牛Cows in a Skyscraper 给出n个物品,体积为w[i],现把其分成若干组,要求每组总体积 include include include include include define LL long long define REP(
阅读全文
摘要:P2915 [USACO08NOV]奶牛混合起来Mixed Up Cows 约翰家有N K$ 即可转移 最后统计所有牛都用上, 不同牛结尾的方案数总和即可 Code cpp include include include include include include define LL long
阅读全文
摘要:总述 状态压缩动态规划,就是我们俗称的 状压DP ,是利用 计算机二进制 的性质来描述状态的一种DP方式 很多棋盘问题都运用到了状压,同时,状压也很经常和BFS及DP连用,例题里会给出介绍 有了状态,DP就比较容易了 举个例子:有一个大小为n n的农田,我们可以在任意处种田,现在来描述一下某一行的某
阅读全文