Blue Bridge Cup official preparation guide " Programming Competition Special Challenge Course " Published in December 2022
Online shopping : Jingdong Dangdang Taobao
If the above link is out of stock, here is the direct post from the publishing house : Jingdong Dangdang Taobao
Article directory
Introduction to "Programming Competition Topic Challenge Course"
People's Posts and Telecommunications Publishing House: Created by gold medal coaches, the official preparation guide for the Blue Bridge Cup is released!
How to prepare for the Blue Bridge Cup Competition with zero foundation ?
I have already started but the knowledge points are not solid, how to make an assault on the Blue Bridge Cup Competition? What are the required knowledge points and common
knowledge points for the Blue Bridge Cup Competition ?
Want to participate in the C/C++ and Python group competitions, is there any competition textbooks written in these two languages?
In December 2022, the new book " Programming Competition Special Challenge Course " will be published, which is suitable for the participants of the Blue Bridge Cup C/C++ group and Python group. This book has the following characteristics:
(1) Covers most of the test points of the Blue Bridge Cup software algorithm competition;
(2) The sample questions include the Blue Bridge Cup real questions and some classic questions, all selected from the test bank of the Blue Bridge Cup official website; (3) The example code is written in
C/C++ and Python , and an electronic resource of Java language code is attached;
(4) The code has been carefully organized and can be used as a template ; Jun has published "Algorithm Competition" and "Introduction to Advanced Algorithm Competition", and has rich
experience .
Readers of this book: beginners in algorithm competitions, or contestants with a certain foundation.
He has learned programming languages, including C/C++, Java, and Python; he has basic coding skills and does not need to ask grammar questions; he may still not be proficient in coding; he has not learned any algorithms and has no ideas when encountering difficult problems. He has the following goals:
(1) In-depth study of algorithm knowledge to improve his computational thinking ability.
(2) Do difficult coding and improve coding ability.
(3) Participate in the Blue Bridge Cup Competition and win prizes.
After finishing this book, you can help readers achieve the above goals.
This book is a book that carefully explains all the relevant contents of the software of the Blue Bridge Cup Competition, including: introduction to the software of the Blue Bridge Cup Competition, hand calculations and miscellaneous problems, basic data structures, basic algorithms, search, advanced data structures, dynamic programming, mathematics, strings, and graph theory .
Contents of "Programming Contest Special Challenge Course"
第1章 蓝桥杯大赛软件类介绍
1.1 蓝桥杯大赛（软件类）的竞赛规则
1.2 竞赛题示例
1.3 算法知识点总览
1.4 历年真题知识点统计
1.5 蓝桥杯判题系统
第2章 手算题和杂题
2.1 手算题攻略
2.1.1 巧用编辑
2.1.2 眼看手数
2.1.3 巧用 Excel
2.1.4 巧用 Python
2.2 杂题
第3章 基础数据结构
3.1 数组
3.2 链表.
3.2.1 C++链表实现
3.2.2 Python 链表实现
3.3 队列
3.3.1 C++普通队列
3.3.2 Python 普通队列
3.3.3 C++优先队列
3.3.4 Python 优先队列
3.4 栈
3.4.1 C++栈的实现
3.4.2 Python 栈的实现
3.5 二叉树
3.5.1 二叉树的定义
3.5.2 二叉树的存储
3.5.3 二叉树的遍历
第4章 基本算法
4.1 算法复杂度
4.1.1 算法的概念
4.1.2 计算资源
4.1.3 选择解题方法
4.1.4 算法复杂度概述
4.2 排序… 73
4.2.1 C++的 sort()函数
4.2.2 Python 的 sort()和 sorted()函数
4.2.3 Java 的 sort()函数
4.3 排列和组合
4.3.1 C++的全排列函数 next_permutation()
4.3.2 Python 的排列函数 permutations()
4.3.3 Python 的组合函数 combinations()
4.3.4 手写排列和组合代码
4.4 尺取法
4.4.1 尺取法的概念
4.4.2 反向扫描
4.4.3 同向扫描
4.5 二分法
4.5.1 二分法的概念
4.5.2 整数二分
4.5.3 整数二分例题
4.5.4 实数二分
4.6 倍增法和 ST 算法
4.6.1 用暴力法解决区间问题
4.6.2 ST 算法
4.6.3 ST 算法的模板代码
4.7 前缀和
4.8 贪心算法
第5章 搜索
5.1 DFS 基础
5.1.1 递归和记忆化搜索
5.1.2 DFS 的代码框架
5.1.3 DFS 的所有路径
5.1.4 DFS 与排列组合
5.1.5 DFS 应用详解
5.1.6 DFS 真题
5.2 BFS 基础
5.2.1 BFS 的原理
5.2.2 BFS 与最短路径
5.3 连通性判断
5.3.1 DFS 连通性判断
5.3.2 BFS 连通性判断
5.3.3 连通性例题
5.4 BFS 与判重
5.5 双向广搜
5.6 剪枝
第6章 高级数据结构
6.1 并查集
6.1.1 用并查集检查连通性
6.1.2 并查集的基本操作
6.1.3 路径压缩
6.2 树状数组
6.2.1 区间和问题
6.2.2 树状数组的原理
6.2.3 lowbit()
6.2.4 树状数组的代码
6.2.5 逆序对问题
6.3 线段树
6.3.1 线段树的概念
6.3.2 区间查询
6.3.3 区间查询例题
6.3.4 区间修改和懒惰标记
第7章 动态规划
7.1 动态规划的概念
7.2 动态规划基础
7.3 线性 DP
7.4 状态压缩 DP
7.4.1 状态压缩 DP 的概念
7.4.2 状态压缩 DP 的原理
7.4.3 位运算
7.5 树形 DP
7.6 数位 DP
第8章 数学
8.1 模运算
8.2 快速幂
8.3 矩阵乘法
8.4 矩阵快速幂
8.5 GCD 和 LCM
8.5.1 GCD 的定义和性质
8.5.2 GCD 的编程实现
8.5.3 LCM
8.6 素数. 286
8.6.1 素数的判断
8.6.2 素数的筛选
8.6.3 区间素数
8.6.4 分解质因子
8.7 组合数学
8.7.1 基本计数
8.7.2 鸽巢原理
8.7.3 二项式定理和杨辉三角
8.8 几何
8.8.1 普通几何题
8.8.2 点和向量
8.8.3 点积和叉积
8.8.4 点和线的关系
第9章 字符串
9.1 字符串函数
9.1.1 C++的字符串函数
9.1.2 Python 的字符串处理
9.1.3 String functions in Java
9.2 Simple string examples
9.3 Naive pattern matching algorithm 9.4
KMP algorithm
Chapter 10 Graph theory 10.1
Basic concept of graph
10.2 Graph storage
10.3 Topological sorting 10.4
Floyd algorithm
10.5 Dijkstra algorithm
10.6 Bellman-Ford algorithm
10.7 SPFA
10.8 Minimum spanning tree
10.8.1 Prim Algorithm
10.8.2 Kruskal's Algorithm