Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-2299\":[\"Ultra-QuickSort\",22368,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2005.02.05\\\"\\u003eWaterloo local 2005.02.05\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3663\":[\"Costume Party\",5371,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2008+January+Bronze\\\"\\u003eUSACO 2008 January Bronze\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2018\":[\"Best Cow Fences\",4406,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2003+March+Green\\\"\\u003eUSACO 2003 March Green\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1314\":[\"聪明的质监员\",24228,\"NOIP2011 提高组\"],\"洛谷-B3637\":[\"最长上升子序列\",25555,null],\"洛谷-P1955\":[\"程序自动分析\",21644,\"NOI2015\"],\"POJ-1845\":[\"Sumdiv\",6191,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dRomania+OI+2002\\\"\\u003eRomania OI 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-867E\":[\"Buy Low Sell High\",227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/867\\\"\\u003eCodeforces Round 437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)\\u003c/a\\u003e\"],\"黑暗爆炸-3668\":[\"起床困难综合症\",211,\"Noi2014\"],\"洛谷-P1080\":[\"国王游戏\",29280,\"NOIP2012 提高组\"],\"AtCoder-abc215_g\":[\"Colorful Candies 2\",232,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc215\\\"\\u003eAtCoder Beginner Contest 215\\u003c/a\\u003e\"],\"洛谷-P1880\":[\"石子合并\",61220,\"NOI1995\"],\"POJ-1456\":[\"Supermarket\",8804,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2003\\\"\\u003eSoutheastern Europe 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1525\":[\"关押罪犯\",42656,\"NOIP2010 提高组\"],\"洛谷-P7076\":[\"动物园\",12129,\"CSP-S2020\"],\"UVA-11729\":[\"Commando War\",8271,null],\"黑暗爆炸-4300\":[\"绝世好题\",73,\"By Oxer\"],\"洛谷-P2024\":[\"食物链\",36242,\"NOI2001\"],\"AtCoder-dp_t\":[\"Permutation\",269,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"洛谷-P5657\":[\"格雷码\",22325,\"CSP-S2019\"],\"POJ-3045\":[\"Cow Acrobats\",3240,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+November+Silver\\\"\\u003eUSACO 2005 November Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"AtCoder-dp_q\":[\"Flowers\",616,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_p\":[\"Independent Set\",912,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_s\":[\"Digit Sum\",766,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_r\":[\"Walk\",395,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_m\":[\"Candies\",965,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_l\":[\"Deque\",1254,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"洛谷-P1219\":[\"八皇后 Checker Challenge\",118397,\"USACO1.5\"],\"AtCoder-dp_o\":[\"Matching\",1027,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_n\":[\"Slimes\",1372,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_i\":[\"Coins\",1992,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_h\":[\"Grid 1\",3546,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_k\":[\"Stones\",1500,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_j\":[\"Sushi\",755,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_e\":[\"Knapsack 2\",3555,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_d\":[\"Knapsack 1\",5595,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_g\":[\"Longest Path\",2493,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_f\":[\"LCS\",3809,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_a\":[\"Frog 1\",6772,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_c\":[\"Vacation\",5733,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"AtCoder-dp_b\":[\"Frog 2\",5922,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"黑暗爆炸-1863\":[\"trouble 皇帝的烦恼\",1,\"Zjoi2006\"],\"洛谷-P4372\":[\"Out of Sorts P\",451,\"USACO18OPEN\"],\"洛谷-P1020\":[\"导弹拦截\",76670,\"NOIP1999 提高组\"],\"黑暗爆炸-3043\":[\"IncDec Sequence\",1059,\"Poetize6\"],\"洛谷-P4375\":[\"Out of Sorts G\",1470,\"USACO18OPEN\"],\"洛谷-P5024\":[\"保卫王国\",4810,\"NOIP2018 提高组\"],\"POJ-2442\":[\"Sequence\",3127,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,Guang Lin\\u003c/div\\u003e\"],\"洛谷-P2512\":[\"糖果传递\",7758,\"HAOI2008\"],\"洛谷-P1226\":[\"快速幂\",107134,\"模板\"],\"POJ-1958\":[\"Strange Towers of Hanoi\",2972,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2002\\\"\\u003eTUD Programming Contest 2002\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"黑暗爆炸-1218\":[\"激光炸弹\",1041,\"HNOI2003\"],\"黑暗爆炸-1257\":[\"余数之和\",369,\"CQOI2007\"],\"POJ-3061\":[\"Subsequence\",14660,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2006\\\"\\u003eSoutheastern Europe 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3263\":[\"Tallest Cow\",3770,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+January+Silver\\\"\\u003eUSACO 2007 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1196\":[\"银河英雄传说\",31318,\"NOI2002\"],\"洛谷-P1352\":[\"没有上司的舞会\",49829,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"NotaKoala","updateTime":1696521697000,"title":"zz11z 校内集训-基本算法例题与习题","dislikeCnt":0,"content":"### 基础知识\n#### 位运算\n[problem:洛谷-P1226] 快速幂模板(蓝书)\n[problem:洛谷-P7076] [CSP-S2020] 数学,二进制表示状态\n[problem:黑暗爆炸-3668] 处理二进制每一位,贪心(蓝书)\n#### 递归与递推\n多项式、指数、排列、组合(蓝书)\n[problem:POJ-1958] 汉诺塔+dp(蓝书)\n补两个递归的题吧\n[problem:洛谷-P5657] **递归分治** \n[problem:POJ-P3889] 递归分治\n[problem:洛谷-P1219] 排列的枚举推荐做一下 八皇后 \n二分、双指针\n[problem:POJ-2018]\n[problem:洛谷-P1314]\n[problem:黑暗爆炸-1863] 思维\n[problem:POJ-3061]\n[problem:POJ-3663]\n递推\n[problem:黑暗爆炸-4300] 二进制+dp递推\n前缀和差分\n[problem:黑暗爆炸-1218]\n[problem:黑暗爆炸-3043]\n[problem:POJ-3263]\n排序\n[problem:POJ-2299]求逆序对数量 树状数组、分治\n[problem:洛谷-P4375]\n[problem:洛谷-P4372]\n中位数\n仓库选址\n[problem:洛谷-P2512] [HAOI2008] 糖果传递\n贪心\n[problem:POJ-3045]\n[problem:洛谷-P1080] 高精度\n[problem:UVA-11729]\n### 数据结构基础\n二叉堆\n[problem:黑暗爆炸-P1090] 贪心、堆\n[problem:POJ-1456]\n[problem:POJ-2442]\n[problem:CodeForces-867E]\n对顶堆维护动态中位数\n并查集\n[problem:洛谷-P1955] 并查集\n[problem:洛谷-P1196]\n最小生成树\n[problem:洛谷-P2024] 扩展域并查集\n[problem:洛谷-P1525] 同上\n哈希表\n字典树\n二叉查找树\n树状数组\nHDU 1166 最近hdu不知道为啥404\n POJ 2352\n POJ 3067; HDU 2838\n线段树\n\n### 图基础\n度数\n拓扑排序 \n特殊情况 环 链 菊花图 判定\n树相关考点比较多,因为树的性质有很多。\n递归求每个子树的大小、深度,树的直径,树的重心。\n### 数学\n逆元\ngcd\n拓展欧几里得\n因数\n线性筛\n#### 欧拉函数\n[problem:黑暗爆炸-1257] \n#### 质因数分解\n[problem:POJ-1845] Sumdiv 分治\n#### 组合数\n杨辉三角递推, 逆元 阶乘\n[problem:AtCoder-abc215_g] 根号\n\n### DP\nhttps://vjudge.net/problem#OJId\u003dAtCoder\u0026probNum\u003ddp\u0026title\u003d\u0026source\u003d\u0026category\u003dall\n\n[problem:AtCoder-dp_a] 递推\n[problem:AtCoder-dp_b] 递推\n[problem:AtCoder-dp_c] 递推\n[problem:AtCoder-dp_d] 背包1\n[problem:AtCoder-dp_e] 背包2\n完全背包\n分组背包\n输出方案\n[problem:AtCoder-dp_f] 最长公共子序列\n[problem:洛谷-B3637] 最长上升子序列 \n[problem:洛谷-P1020] LIS习题 可以把Q写了 不难也是LIS模板\n[problem:AtCoder-dp_g] **拓扑排序** 重要\n[problem:AtCoder-dp_h] 递推 加法原理\n[problem:AtCoder-dp_i] 递推 概率\n[problem:AtCoder-dp_j] 状态设计 期望\n[problem:AtCoder-dp_k] 博弈论\n[problem:AtCoder-dp_l] 区间dp\n[problem:AtCoder-dp_m] 前缀和优化\n[problem:AtCoder-dp_n] 区间dp\n[problem:洛谷-P1880] 区间dp 断环为链\n[problem:AtCoder-dp_o] 状态压缩dp\n[problem:AtCoder-dp_p] 树形dp 独立集\n[problem:洛谷-P1352] 树形dp\n[problem:洛谷-P5024] 44分 $O(n \\cdot m)$ 树形dp\n[problem:AtCoder-dp_q] 最长上升子序列 $O(n\\log n)$\n下面这仨有点难\n[problem:AtCoder-dp_r] 矩阵乘法 \n[problem:AtCoder-dp_s] 数位dp (每一位,贴上界和其他情况,分情况讨论统计答案数量即可)\n[problem:AtCoder-dp_t] 斜率优化(这题是简单的斜率优化题,前置知识单调队列,如果 $x$ 不单调,用cdq分治或splay优化) 可以先学学单调队列和单调栈的题目,这些也非常考验思维能力。\n### 杂\n#### 根号\nhttps://csacademy.com/app/graph_editor/\n","threadId":170956,"likeCnt":0,"createTime":1696134871000,"isWorkbook":true,"viewCnt":332,"openness":2,"fav":false,"id":4118,"trustable":false}