Training materials as well as related topics of the Peking University ACM source code. Which involves: a combination of mathematics, search, dynamic programming, graph theory, computational geometry, and handouts and exercises the source code of the network flow.

北大ACM训练课件\北大ACM训练课件\北大ACM训练作业\acm1151.htm
...............\...............\...............\acm1195.htm
...............\...............\...............\acm2528.htm
...............\...............\...............\acm3264.htm
...............\...............\...............\acm3321.htm
...............\...............\...............\acm3468.htm
...............\...............\...........期中考试\Problems_new.docx
...............\...............\...........第一讲：线段树和树状数组\1_interval_tree.pdf
...............\...............\...................................\acm1151.htm
...............\...............\...................................\acm1195.htm
...............\...............\...................................\acm2528.htm
...............\...............\...................................\acm3264.htm
...............\...............\...................................\acm3321.htm
...............\...............\...................................\acm3468.htm
...............\...............\.............七讲：搜索：深搜，广搜，剪枝，IDA算法\4_game_theory.ppt
...............\...............\..................................................\4_nim.txt
...............\...............\..................................................\4_search.ppt
...............\...............\.............三讲：动态规划\动态规划(facer).ppt
...............\...............\...........................\动态规划(facer)[1].pdf
...............\...............\.............二讲：计算几何\计算几何-半平面.ppt
...............\...............\...........................\计算几何1.pdf
...............\...............\...........................\计算几何2.ppt
...............\...............\...........................\计算几何资料.txt
...............\...............\...........................\src\1066.cpp
...............\...............\...........................\...\1113.cpp
...............\...............\...........................\...\1271.cpp
...............\...............\...........................\...\2069.cpp
...............\...............\...........................\...\3502.cpp
...............\...............\...........................\...\3521.cpp
...............\...............\.............五讲：数学\math.pdf
...............\...............\.............八讲：网络流算法：基本的网络流算法，Dinic算法，带上下界的网络流，最小费用流\gw_netflow.pptx
...............\...............\.............六讲：最小生成树及其扩展，强连通分量\gw_connect.ppt
...............\...............\.................................................\gw_mst.ppt
...............\...............\.............四讲：最小生成树及其扩展，强连通分量\gw_connect.ppt
...............\...............\.................................................\gw_mst.ppt
...............\...............\.............二讲：计算几何\src
...............\...............\北大ACM训练作业
...............\...............\北大ACM训练期中考试
...............\...............\北大ACM训练第一讲：线段树和树状数组
...............\...............\北大ACM训练第七讲：搜索：深搜，广搜，剪枝，IDA算法
...............\...............\北大ACM训练第三讲：动态规划
...............\...............\北大ACM训练第二讲：计算几何
...............\...............\北大ACM训练第五讲：数学
...............\...............\北大ACM训练第八讲：网络流算法：基本的网络流算法，Dinic算法，带上下界的网络流，最小费用流
...............\...............\北大ACM训练第六讲：最小生成树及其扩展，强连通分量
...............\...............\北大ACM训练第四讲：最小生成树及其扩展，强连通分量
...............\北大ACM训练课件
北大ACM训练课件

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．