零碎蓝桥备战知识点

骑猪看日落 2022-02-01 15:27 171阅读 0赞

*  最小生成树（Kruskal和Prim算法）：[http://blog.csdn.net/luoshixian099/article/details/51908175][http_blog.csdn.net_luoshixian099_article_details_51908175]
 *  并查集：[https://blog.csdn.net/niushuai666/article/details/6662911][https_blog.csdn.net_niushuai666_article_details_6662911]
 *  莫比乌斯反演：[https://blog.csdn.net/ACdreamers/article/details/8542292][https_blog.csdn.net_ACdreamers_article_details_8542292]
 *  扩展的欧几里得：[https://blog.csdn.net/leader\_one/article/details/75222771][https_blog.csdn.net_leader_one_article_details_75222771]
 *  背包九讲：[https://blog.csdn.net/pi9nc/article/details/8142876][https_blog.csdn.net_pi9nc_article_details_8142876]  
    [https://blog.csdn.net/stack\_queue/article/details/53544109][https_blog.csdn.net_stack_queue_article_details_53544109]
 *  KMP算法：[https://blog.csdn.net/kornberg\_fresnel/article/details/78002188][https_blog.csdn.net_kornberg_fresnel_article_details_78002188]

蓝桥杯题目–地宫取宝–动态规划：[https://blog.csdn.net/yinxiaobao97/article/details/84798982][https_blog.csdn.net_yinxiaobao97_article_details_84798982]  
[https://blog.csdn.net/Divide\_/article/details/51228637][https_blog.csdn.net_Divide_article_details_51228637]  
[https://blog.csdn.net/yyl424525/article/details/60331207][https_blog.csdn.net_yyl424525_article_details_60331207]

历届试题—对局匹配（贪心）：  
[https://blog.csdn.net/u013852115/article/details/83384802][https_blog.csdn.net_u013852115_article_details_83384802]  
（分组+背包）；  
[https://blog.csdn.net/tianwei0822/article/details/80422620][https_blog.csdn.net_tianwei0822_article_details_80422620]

蓝桥杯 历届试题 大臣的旅费：  
[https://blog.csdn.net/ReidSC/article/details/67854352][https_blog.csdn.net_ReidSC_article_details_67854352]

2017第八届蓝桥杯决赛\_发现环  
[https://blog.csdn.net/z956281507/article/details/72796735][https_blog.csdn.net_z956281507_article_details_72796735]

强连通算法–Tarjan：  
[https://blog.csdn.net/acmmmm/article/details/16361033][https_blog.csdn.net_acmmmm_article_details_16361033]  
[https://blog.csdn.net/mengxiang000000/article/details/51672725][https_blog.csdn.net_mengxiang000000_article_details_51672725]

蓝桥杯省赛C++A组B组题解整理：  
[https://blog.csdn.net/ryo\_218/article/details/79660650][https_blog.csdn.net_ryo_218_article_details_79660650]  
[https://blog.csdn.net/sihai12345/article/details/79252274][https_blog.csdn.net_sihai12345_article_details_79252274]

蓝桥杯省赛知识点  
1、C++ STL 常见算法  
2、C++ 输入输出（包括流、文件）  
3、C++常用泛型：list vector stack map  
4、暴力穷举  
5、递归  
6、全排列 next\_permutation 康托展开式  
7、回溯  
8、DFS、BFS、hash表  
9、数学上的有：辗转相除（两行内），素数等

国赛知识点  
1、hash表  
2、大数（高精度）加减乘除  
3、线段树  
4、并查集  
5、图论相关算法：最短路(Floyd、Dijstra,BellmanFord)、最小生成树(prim,kruscal要用并查集)  
6、熟悉动态规划的各个典型：LCS、最长递增子串、三角剖分、记忆化dp  
7、博弈类算法：博弈树，二进制法等。  
8、双向广度搜索、A\*算法，最小耗散优先  
9、数学：线段交点、多角形面积公式等

[http_blog.csdn.net_luoshixian099_article_details_51908175]: http://blog.csdn.net/luoshixian099/article/details/51908175
[https_blog.csdn.net_niushuai666_article_details_6662911]: https://blog.csdn.net/niushuai666/article/details/6662911
[https_blog.csdn.net_ACdreamers_article_details_8542292]: https://blog.csdn.net/ACdreamers/article/details/8542292
[https_blog.csdn.net_leader_one_article_details_75222771]: https://blog.csdn.net/leader_one/article/details/75222771
[https_blog.csdn.net_pi9nc_article_details_8142876]: https://blog.csdn.net/pi9nc/article/details/8142876
[https_blog.csdn.net_stack_queue_article_details_53544109]: https://blog.csdn.net/stack_queue/article/details/53544109
[https_blog.csdn.net_kornberg_fresnel_article_details_78002188]: https://blog.csdn.net/kornberg_fresnel/article/details/78002188
[https_blog.csdn.net_yinxiaobao97_article_details_84798982]: https://blog.csdn.net/yinxiaobao97/article/details/84798982
[https_blog.csdn.net_Divide_article_details_51228637]: https://blog.csdn.net/Divide_/article/details/51228637
[https_blog.csdn.net_yyl424525_article_details_60331207]: https://blog.csdn.net/yyl424525/article/details/60331207
[https_blog.csdn.net_u013852115_article_details_83384802]: https://blog.csdn.net/u013852115/article/details/83384802
[https_blog.csdn.net_tianwei0822_article_details_80422620]: https://blog.csdn.net/tianwei0822/article/details/80422620
[https_blog.csdn.net_ReidSC_article_details_67854352]: https://blog.csdn.net/ReidSC/article/details/67854352
[https_blog.csdn.net_z956281507_article_details_72796735]: https://blog.csdn.net/z956281507/article/details/72796735
[https_blog.csdn.net_acmmmm_article_details_16361033]: https://blog.csdn.net/acmmmm/article/details/16361033
[https_blog.csdn.net_mengxiang000000_article_details_51672725]: https://blog.csdn.net/mengxiang000000/article/details/51672725
[https_blog.csdn.net_ryo_218_article_details_79660650]: https://blog.csdn.net/ryo_218/article/details/79660650
[https_blog.csdn.net_sihai12345_article_details_79252274]: https://blog.csdn.net/sihai12345/article/details/79252274