CCF-CSP必学知识

上传者: 44603934 | 上传时间: 2022-05-23 14:03:58 | 文件大小: 833KB | 文件类型: RAR
有关CCF的CSP认证 一、CSP认证考点的知识要求 在数据结构中,线性表是基础,树是常考点,集合和映射要夕纪学。 背包问题(动态规划) 考试要求 二、考试题型 第一题:一般为水题,把C学扎实便可以过 第二题:难度比第一题大,比较多陷阱 第三题:题目很长但是思维难度不会比第二题大 第四题、第五题:难度大,变态题 三、知识点分布 1、字符串 对于字符串的以上处理要做到熟练,并且能够快速讲码打出。 例题分析(2013年12月第二题) C(有越界风险,可用c++的动态数组来写): 问题:输入后只是跳过了‘-’,但是无法判断到底这个符号是在哪里,如果输入“067-0-821162-4”同样会输出“Right”。但是考试系统不管这个,只检查输出即可。(漏洞) 2、数论 重要算法思想: 素数筛选的两种方法,排列组合(可暴力穷举),快速幂 3、STL数据结构 尤其熟悉map,wector,string 对于map的介绍(会用就可以了): map容器中常用的函数: ps:不可以对map使用sort函数,输入是无序的,会自动排序,输出是有序的 4、排序 论稳定性,越低

文件下载

资源详情

[{"title":"( 70 个子文件 833KB ) CCF-CSP必学知识","children":[{"title":"CCF-CSP必学知识","children":[{"title":"5 数据结构","children":[{"title":"区间树状数组.cpp <span style='color:#111;'> 1.16KB </span>","children":null,"spread":false},{"title":"区间线段树.cpp <span style='color:#111;'> 1.80KB </span>","children":null,"spread":false},{"title":"Trie.cpp <span style='color:#111;'> 863B </span>","children":null,"spread":false},{"title":"KMP.cpp <span style='color:#111;'> 835B </span>","children":null,"spread":false},{"title":"树状数组.cpp <span style='color:#111;'> 310B </span>","children":null,"spread":false},{"title":"AC自动机.cpp <span style='color:#111;'> 3.05KB </span>","children":null,"spread":false}],"spread":true},{"title":"演示文稿1.ppt <span style='color:#111;'> 1.75MB </span>","children":null,"spread":false},{"title":"4 动态规划","children":[{"title":"01背包2.cpp <span style='color:#111;'> 428B </span>","children":null,"spread":false},{"title":"多重背包2.cpp <span style='color:#111;'> 856B </span>","children":null,"spread":false},{"title":"多重背包1.cpp <span style='color:#111;'> 547B </span>","children":null,"spread":false},{"title":"分组背包.cpp <span style='color:#111;'> 559B </span>","children":null,"spread":false},{"title":"数位DP.cpp <span style='color:#111;'> 834B </span>","children":null,"spread":false},{"title":"二维费用背包.cpp <span style='color:#111;'> 614B </span>","children":null,"spread":false},{"title":"01背包1.cpp <span style='color:#111;'> 495B </span>","children":null,"spread":false},{"title":"完全背包.cpp <span style='color:#111;'> 419B </span>","children":null,"spread":false},{"title":"混合背包(通用).cpp <span style='color:#111;'> 1.06KB </span>","children":null,"spread":false}],"spread":true},{"title":"9 新模板","children":[{"title":"单调队列.cpp <span style='color:#111;'> 758B </span>","children":null,"spread":false},{"title":"最小生成树_Prim.cpp <span style='color:#111;'> 1.30KB </span>","children":null,"spread":false},{"title":"矩形面积并.cpp <span style='color:#111;'> 2.85KB </span>","children":null,"spread":false},{"title":"最短路_Bellman_邻接矩阵.cpp <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false},{"title":"最短路_Bellman_邻接表.cpp <span style='color:#111;'> 1.10KB </span>","children":null,"spread":false},{"title":"KMP.cpp <span style='color:#111;'> 939B </span>","children":null,"spread":false},{"title":"匈牙利算法_Dfs.cpp <span style='color:#111;'> 1018B </span>","children":null,"spread":false},{"title":"最小生成树_Kruskal.cpp <span style='color:#111;'> 1.68KB </span>","children":null,"spread":false},{"title":"矩形周长并.cpp <span style='color:#111;'> 2.47KB </span>","children":null,"spread":false},{"title":"最短路_SPFA_前向星.cpp <span style='color:#111;'> 1.68KB </span>","children":null,"spread":false},{"title":"匈牙利算法_Bfs.cpp <span style='color:#111;'> 1.42KB </span>","children":null,"spread":false},{"title":"最短路_SPFA_邻接表.cpp <span style='color:#111;'> 2.08KB </span>","children":null,"spread":false},{"title":"网络流_Dinic.cpp <span style='color:#111;'> 1.31KB </span>","children":null,"spread":false},{"title":"网络流_Hierarchical .cpp <span style='color:#111;'> 2.10KB </span>","children":null,"spread":false},{"title":"最短路_Floyd.cpp <span style='color:#111;'> 1.50KB </span>","children":null,"spread":false},{"title":"网络流_Push_Relabel.cpp <span style='color:#111;'> 1.62KB </span>","children":null,"spread":false},{"title":"最短路_Dijkstra.cpp <span style='color:#111;'> 1.72KB </span>","children":null,"spread":false},{"title":"并查集.cpp <span style='color:#111;'> 177B </span>","children":null,"spread":false},{"title":"网络流_Ford_Fulkerson.cpp <span style='color:#111;'> 2.11KB </span>","children":null,"spread":false}],"spread":false},{"title":"7 其他模板","children":[{"title":"日期相隔天数.cpp <span style='color:#111;'> 586B </span>","children":null,"spread":false},{"title":"星期计算.cpp <span style='color:#111;'> 253B </span>","children":null,"spread":false},{"title":"高精度模板.cpp <span style='color:#111;'> 2.61KB </span>","children":null,"spread":false},{"title":"文件读写.cpp <span style='color:#111;'> 239B </span>","children":null,"spread":false},{"title":"字符串化整型.cpp <span style='color:#111;'> 201B </span>","children":null,"spread":false},{"title":"并查集.cpp <span style='color:#111;'> 177B </span>","children":null,"spread":false},{"title":"罗马进制转换.cpp <span style='color:#111;'> 780B </span>","children":null,"spread":false},{"title":"数字反转+回判断文串.cpp <span style='color:#111;'> 316B </span>","children":null,"spread":false}],"spread":true},{"title":"1 数学模板","children":[{"title":"中国剩余定理.cpp <span style='color:#111;'> 492B </span>","children":null,"spread":false},{"title":"单变元模线性方程.cpp <span style='color:#111;'> 369B </span>","children":null,"spread":false},{"title":"素数筛法1.cpp <span style='color:#111;'> 343B </span>","children":null,"spread":false},{"title":"素数筛法2.cpp <span style='color:#111;'> 343B </span>","children":null,"spread":false},{"title":"逆元组合数.cpp <span style='color:#111;'> 855B </span>","children":null,"spread":false},{"title":"欧几里得算法.cpp <span style='color:#111;'> 59B </span>","children":null,"spread":false},{"title":"快速幂取模.cpp <span style='color:#111;'> 473B </span>","children":null,"spread":false},{"title":"质因数分解.cpp <span style='color:#111;'> 430B </span>","children":null,"spread":false},{"title":"拓展欧几里得.cpp <span style='color:#111;'> 215B </span>","children":null,"spread":false},{"title":"矩阵+快速幂.cpp <span style='color:#111;'> 1.12KB </span>","children":null,"spread":false},{"title":"欧拉函数.cpp <span style='color:#111;'> 464B </span>","children":null,"spread":false},{"title":"素数判定.cpp <span style='color:#111;'> 110B </span>","children":null,"spread":false},{"title":"进制转换.cpp <span style='color:#111;'> 498B </span>","children":null,"spread":false}],"spread":false},{"title":"3 排序模板","children":[{"title":"堆排序.cpp <span style='color:#111;'> 739B </span>","children":null,"spread":false},{"title":"归并排序+逆序对.cpp <span style='color:#111;'> 979B </span>","children":null,"spread":false},{"title":"快速排序.cpp <span style='color:#111;'> 667B </span>","children":null,"spread":false}],"spread":true},{"title":"2 图论模板","children":[{"title":"最短路bellman.cpp <span style='color:#111;'> 1.16KB </span>","children":null,"spread":false},{"title":"最小生成树kruskal+并查集.cpp <span style='color:#111;'> 1.41KB </span>","children":null,"spread":false},{"title":"最短路floyd.cpp <span style='color:#111;'> 1.60KB </span>","children":null,"spread":false},{"title":"最小生成树prim_unique.cpp <span style='color:#111;'> 1.53KB </span>","children":null,"spread":false},{"title":"最短路SPFA.cpp <span style='color:#111;'> 2.08KB </span>","children":null,"spread":false},{"title":"最小生成树prim.cpp <span style='color:#111;'> 1.41KB </span>","children":null,"spread":false},{"title":"最短路dijkstra.cpp <span style='color:#111;'> 1.55KB </span>","children":null,"spread":false},{"title":"最短路bellman-ford.cpp <span style='color:#111;'> 1.45KB </span>","children":null,"spread":false},{"title":"拓扑排序.cpp <span style='color:#111;'> 1.70KB </span>","children":null,"spread":false},{"title":"最小生成树kruskal_unique.cpp <span style='color:#111;'> 2.04KB </span>","children":null,"spread":false},{"title":"欧拉回路Fleury.cpp <span style='color:#111;'> 1.46KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明