文件名称:code
介绍说明--下载内容均来自于网络,请自行研究使用
杭电acm解题报告2001---2099.-Hangzhou Xinhua report acm solving 2001--- 2099.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
文件名 | 大小 | 更新时间 |
---|---|---|
code | ||
....\12月赛解题报告 | ||
....\..............\1555.txt | ||
....\..............\1556.txt | ||
....\..............\1557.txt | ||
....\..............\1558.txt | ||
....\..............\1559.txt | ||
....\..............\1560.txt | ||
....\..............\月赛解题报告.rar | ||
....\2006校园文化活动月 | ||
....\..................\1491.txt | ||
....\..................\1492.txt | ||
....\..................\1493.txt | ||
....\..................\1494.txt | ||
....\..................\1495.txt | ||
....\..................\1496.txt | ||
....\..................\1497.txt | ||
....\..................\1498.txt | ||
....\..................\2006校园文化活动月.rar | ||
....\A Chess Game(博弈SG).cpp | ||
....\A New Change Problem(互质数最大不可能数).cpp | ||
....\A New Tetris Game(2)(博弈SG).cpp | ||
....\A Number Puzzle(dfs+hash).cpp | ||
....\A Plug for UNIX(ford_forlkerson).cpp | ||
....\A Simple Math Problem(矩阵二分).cpp | ||
....\Air Raid(DAG最小路径覆盖).cpp | ||
....\Arctic Network(最小生成树).cpp | ||
....\Asteroids(二分图最小顶点覆盖).cpp | ||
....\Atlantis(离散化N^3).cpp | ||
....\Atlantis(线段树求矩形并).cpp | ||
....\Balanced Lineup(标准RMQ-ST).cpp | ||
....\Balanced Lineup(线段树).cpp | ||
....\Bandwidth(dfs剪枝).cpp | ||
....\Beautiful People(DP O(NlogN)).cpp | ||
....\Big Christmas Tree(最短路).cpp | ||
....\Biorhythms(中国剩余定理).cpp | ||
....\Bridging signals(DP(NlogN)).cpp | ||
....\Bubble Shooter(dfs).cpp | ||
....\Building roads(二分+2-SAT).cpp | ||
....\Burn the Linked Camp(差分约束).cpp | ||
....\Burning Bridges(割边,有平行边).cpp | ||
....\Cake Share(farey递归造树).cpp | ||
....\Calendar Game(博弈搜索).cpp | ||
....\Card Game Cheater(最大二分匹配).cpp | ||
....\Cashier Employment(差分约束).cpp | ||
....\Catenyms(欧拉路,输出路径).cpp | ||
....\Chinese remainder theorem again(数论).cpp | ||
....\Cipher(置换群,找循环节).cpp | ||
....\Collect More Jewels(bfs+dfs).cpp | ||
....\copying books(DP).cpp | ||
....\Count Color(poj区间颜色数,线段树).cpp | ||
....\Count the Colors(zoj涂色线段数,线段树).cpp | ||
....\Count the Tetris(置换群).cpp | ||
....\Cow Sorting(置换群,最小花费置换).cpp | ||
....\Cow Traffic(dfs求边通过次数).cpp | ||
....\Crazy Thairs(线段树求逆序数).cpp | ||
....\Cupid's Arrow(计算几何) .cpp | ||
....\Desert King (最优比率生成树).cpp | ||
....\Digital Deletions(博弈搜索).cpp | ||
....\Doing Homework again(贪心).cpp | ||
....\Drainage Ditches(ford_forlkerson)O(VE^2).cpp | ||
....\Drainage Ditches(high_label_preflow_push)O(V^2E).cpp | ||
....\Ellipse(椭圆截面积).cpp | ||
....\Euro Efficiency(bellman_ford).cpp | ||
....\Farey Sequence(farey序列数).cpp | ||
....\Farey Sequence(朴素构造).cpp | ||
....\Farey Sequence(递归造树).cpp | ||
....\Farm Irrigation(dfs).cpp | ||
....\FatMouse's Speed(DP).cpp | ||
....\find the mincost route(最短路).cpp | ||
....\Frequent values(线段).cpp | ||
....\Frequent values(线段树).cpp | ||
....\GCD Again(欧拉函数).cpp | ||
....\Get Luffy Out(2-SAT).cpp | ||
....\Girls and Boys(二分图最大独立集).cpp | ||
....\Going from u to v or from v to u(强连通分量).cpp | ||
....\Going Home(带权二分匹配KM O(N^4)).cpp | ||
....\Gopher II(二分匹配).cpp | ||
....\Graph Coloring(最大独立集).cpp | ||
....\Happy Children’s Day(RMQ线段树成段更新).cpp | ||
....\hit1917 Peaceful Commission(2-SAT | O(m)).cpp | |
....\hit1917 Peaceful Commission(2-SAT | O(m))2.cpp | |
....\hit1917 Peaceful Commission(2-SAT | O(nm)).cpp | |
....\I Hate It(linle版).cpp | ||
....\I Hate It(模板改进版).cpp | ||
....\I Hate It(线段树) .cpp | ||
....\Idiomatic Phrases Game(最短路).cpp | ||
....\Intervals(差分约束).cpp | ||
....\Inversion(构造逆序数用线段树).cpp | ||
....\Inversion(求逆序数,逆序数求序列,用线段树).cpp | ||
....\Invitation Cards(Bellman ford优化).cpp | ||
....\Kadj Squares(模拟).cpp | ||
....\King(差分约束).cpp | ||
....\Let it Bead(polya).cpp | ||
....\Long Long Message(后缀数组,lcp).cpp | ||
....\Luck and Love(二维线段树).cpp | ||
....\Machine Schedule(二分图最小顶点覆盖).cpp | ||
....\Magic Bean(矩阵二分).cpp | ||
....\Marriage is Stable(稳定婚姻匹配).cpp | ||
....\Matrix Searching(二维静态RMQ二维线段树实现).cpp |