https://blog.youkuaiyun.com/LZY_Starryzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/LZY_Starry/article/details/118968827https://blog.youkuaiyun.com/LZY_Starry/article/details/118968827LZY_StarryWed, 21 Jul 2021 16:03:54 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/78881538https://blog.youkuaiyun.com/LZY_Starry/article/details/78881538LZY_StarrySat, 23 Dec 2017 18:45:52 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/78669288https://blog.youkuaiyun.com/LZY_Starry/article/details/78669288LZY_StarryWed, 29 Nov 2017 20:02:18 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/78665453https://blog.youkuaiyun.com/LZY_Starry/article/details/78665453LZY_StarryWed, 29 Nov 2017 15:01:32 +0800 using namespace std;const int maxn=4e4+7;int d[maxn],a[maxn];int main() { int i,j,k,p,t; scanf("%d",&t); while(t--) { scanf("%d",&p);]]>https://blog.youkuaiyun.com/LZY_Starry/article/details/78645661https://blog.youkuaiyun.com/LZY_Starry/article/details/78645661LZY_StarryMon, 27 Nov 2017 15:40:52 +0800 #include #include #includehttps://blog.youkuaiyun.com/LZY_Starry/article/details/78615742https://blog.youkuaiyun.com/LZY_Starry/article/details/78615742LZY_StarryThu, 23 Nov 2017 15:57:42 +0800 #define pb push_back #define mp make_pair using namespace std;const int maxn=2e5+7; typedef]]>https://blog.youkuaiyun.com/LZY_Starry/article/details/78087025https://blog.youkuaiyun.com/LZY_Starry/article/details/78087025LZY_StarryMon, 25 Sep 2017 16:55:59 +0800 #define pb push_back #define mp make_pair using namespace std;const int max]]>https://blog.youkuaiyun.com/LZY_Starry/article/details/76890726https://blog.youkuaiyun.com/LZY_Starry/article/details/76890726LZY_StarryTue, 08 Aug 2017 12:00:48 +0800 #define pb push_back #define mp make_pair using namespace std;const int maxn=2e5+7; typedef lon]]>https://blog.youkuaiyun.com/LZY_Starry/article/details/76890366https://blog.youkuaiyun.com/LZY_Starry/article/details/76890366LZY_StarryTue, 08 Aug 2017 11:56:12 +0800 #define pb push_back #define mp make_pair using namespace std;const int maxn=1; type]]>https://blog.youkuaiyun.com/LZY_Starry/article/details/76824356https://blog.youkuaiyun.com/LZY_Starry/article/details/76824356LZY_StarryMon, 07 Aug 2017 11:06:58 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/76651212https://blog.youkuaiyun.com/LZY_Starry/article/details/76651212LZY_StarryThu, 03 Aug 2017 21:32:25 +0800 #define pb push_back #define mp make_pair #define pow powe using namespace std;const int m]]>https://blog.youkuaiyun.com/LZY_Starry/article/details/76651008https://blog.youkuaiyun.com/LZY_Starry/article/details/76651008LZY_StarryThu, 03 Aug 2017 21:13:15 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/76599484https://blog.youkuaiyun.com/LZY_Starry/article/details/76599484LZY_StarryWed, 02 Aug 2017 22:36:53 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/76598633https://blog.youkuaiyun.com/LZY_Starry/article/details/76598633LZY_StarryWed, 02 Aug 2017 21:15:08 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/75331207https://blog.youkuaiyun.com/LZY_Starry/article/details/75331207LZY_StarryTue, 18 Jul 2017 21:56:57 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/75267796https://blog.youkuaiyun.com/LZY_Starry/article/details/75267796LZY_StarryMon, 17 Jul 2017 20:35:32 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/75267699https://blog.youkuaiyun.com/LZY_Starry/article/details/75267699LZY_StarryMon, 17 Jul 2017 20:27:18 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/74858263https://blog.youkuaiyun.com/LZY_Starry/article/details/74858263LZY_StarrySun, 09 Jul 2017 11:56:11 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/74857589https://blog.youkuaiyun.com/LZY_Starry/article/details/74857589LZY_StarrySun, 09 Jul 2017 10:32:20 +0800https://blog.youkuaiyun.com/LZY_Starry/article/details/74779885https://blog.youkuaiyun.com/LZY_Starry/article/details/74779885LZY_StarryFri, 07 Jul 2017 21:07:21 +0800一维 基础的倒序更新（注意更新思想可供其他题借鉴） “恰”装满：f[i][0]=0; 去掉“恰”：f[i][j]=0; （适用于许多种状态更新的题） 2.完全背包 顺序更新，前赴后继（注意更新思想） 引出简单有效的贪心单价优化 引出二进制压缩思想 3.多重背包 掌握二进制压缩 用单调队列解的O（VN）的解法（待掌握） 4.二维背包 问题描述：两重代价（约束） 解法：加一维 注意]]>