ACM北大集训资料.rar

[{"title":"（ 43 个子文件 16.89MB ） ACM北大集训资料.rar","children":[{"title":"ACM北大集训资料","children":[{"title":"并查集","children":[{"title":"gw_Disjoint Set.pptx <span style='color:#111;'> 433.54KB </span>","children":null,"spread":false},{"title":"gw_dfa.ppt <span style='color:#111;'> 1.82MB </span>","children":null,"spread":false}],"spread":true},{"title":"数论","children":[{"title":"lcc-数论.pptx <span style='color:#111;'> 319.66KB </span>","children":null,"spread":false},{"title":"lcc-数学杂题.pptx <span style='color:#111;'> 308.88KB </span>","children":null,"spread":false},{"title":"lcc-群论.pptx <span style='color:#111;'> 409.43KB </span>","children":null,"spread":false}],"spread":true},{"title":"图论","children":[{"title":"Bellman-ford算法.ppt <span style='color:#111;'> 537.50KB </span>","children":null,"spread":false},{"title":"Dijkstra Algorithm.pptx <span style='color:#111;'> 91.30KB </span>","children":null,"spread":false},{"title":"SPFA算法.ppt <span style='color:#111;'> 519.00KB </span>","children":null,"spread":false},{"title":"弗洛伊德算法.ppt <span style='color:#111;'> 1.19MB </span>","children":null,"spread":false},{"title":"强连通分量.ppt <span style='color:#111;'> 1.86MB </span>","children":null,"spread":false}],"spread":true},{"title":"练习题","children":[{"title":"多校4_解题报告.doc <span style='color:#111;'> 17.00KB </span>","children":null,"spread":false},{"title":"浅谈ACM_ICPC的题目风格和近几年题目的发展.doc <span style='color:#111;'> 33.00KB </span>","children":null,"spread":false},{"title":"多校第三场解题报告.pdf <span style='color:#111;'> 365.67KB </span>","children":null,"spread":false},{"title":"2013暑期多校联合训练第一场0723-解题报告.pdf <span style='color:#111;'> 444.36KB </span>","children":null,"spread":false},{"title":"多校联合第二场解题报告","children":[{"title":"微博桌面2012_2086872061.JPG <span style='color:#111;'> 70.31KB </span>","children":null,"spread":false},{"title":"Thumbs.db <span style='color:#111;'> 38.50KB </span>","children":null,"spread":false},{"title":"微博桌面2012_478949545.JPG <span style='color:#111;'> 99.88KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"Thumbs.db <span style='color:#111;'> 28.50KB </span>","children":null,"spread":false},{"title":"线段树-树状数组.pdf <span style='color:#111;'> 2.26MB </span>","children":null,"spread":false},{"title":"计算几何","children":[{"title":"计算几何.pdf <span style='color:#111;'> 403.45KB </span>","children":null,"spread":false},{"title":"计算几何-yjy.pptx <span style='color:#111;'> 131.03KB </span>","children":null,"spread":false}],"spread":true},{"title":"搜索","children":[{"title":"sticks_demo.dat <span style='color:#111;'> 989.50KB </span>","children":null,"spread":false},{"title":"广搜与八数码.ppt <span style='color:#111;'> 1.20MB </span>","children":null,"spread":false},{"title":"高级搜索之A星算法.ppt <span style='color:#111;'> 485.50KB </span>","children":null,"spread":false},{"title":"深搜剪枝.pptx <span style='color:#111;'> 1.71MB </span>","children":null,"spread":false}],"spread":true},{"title":"搜索方式的选择.ppt <span style='color:#111;'> 322.00KB </span>","children":null,"spread":false},{"title":"最小生成树和动态规划","children":[{"title":"1679.htm <span style='color:#111;'> 3.98KB </span>","children":null,"spread":false},{"title":"动态规划.ppt <span style='color:#111;'> 512.00KB </span>","children":null,"spread":false},{"title":"1639.htm <span style='color:#111;'> 5.33KB </span>","children":null,"spread":false},{"title":"2349.cpp <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"acm2560_heap.htm <span style='color:#111;'> 2.84KB </span>","children":null,"spread":false},{"title":"3159.htm <span style='color:#111;'> 2.99KB </span>","children":null,"spread":false},{"title":"2728.htm <span style='color:#111;'> 3.40KB </span>","children":null,"spread":false},{"title":"gw_mst_new.pdf <span style='color:#111;'> 1.02MB </span>","children":null,"spread":false}],"spread":true},{"title":"次小生成树.txt <span style='color:#111;'> 4.25KB </span>","children":null,"spread":false},{"title":"gw_mst.pdf <span style='color:#111;'> 912.09KB </span>","children":null,"spread":false},{"title":"trie图","children":[{"title":"gw_Disjoint Set.pptx <span style='color:#111;'> 433.54KB </span>","children":null,"spread":false},{"title":"gw_dfa.ppt <span style='color:#111;'> 1.82MB </span>","children":null,"spread":false}],"spread":true},{"title":"堆以及堆的应用.ppt <span style='color:#111;'> 133.00KB </span>","children":null,"spread":false},{"title":"最短路与差分约束系统--neko13.ppt <span style='color:#111;'> 286.50KB </span>","children":null,"spread":false},{"title":"做男人不容易系列是男人就过8题.ppt <span style='color:#111;'> 509.50KB </span>","children":null,"spread":false},{"title":"网络流算法","children":[{"title":"2396.cpp <span style='color:#111;'> 5.70KB </span>","children":null,"spread":false},{"title":"gw_netflow.pdf <span style='color:#111;'> 6.66MB </span>","children":null,"spread":false}],"spread":false}],"spread":false}],"spread":true}]