文件名称:code
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:158.89kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
杭电acm解题报告2001---2099.-Hangzhou Xinhua report acm solving 2001--- 2099.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
文件名 | 大小 | 更新时间 |
---|---|---|
code/12月赛解题报告/1555.txt | ||
code/12月赛解题报告/1556.txt | ||
code/12月赛解题报告/1557.txt | ||
code/12月赛解题报告/1558.txt | ||
code/12月赛解题报告/1559.txt | ||
code/12月赛解题报告/1560.txt | ||
code/12月赛解题报告/月赛解题报告.rar | ||
code/12月赛解题报告 | ||
code/2006校园文化活动月/1491.txt | ||
code/2006校园文化活动月/1492.txt | ||
code/2006校园文化活动月/1493.txt | ||
code/2006校园文化活动月/1494.txt | ||
code/2006校园文化活动月/1495.txt | ||
code/2006校园文化活动月/1496.txt | ||
code/2006校园文化活动月/1497.txt | ||
code/2006校园文化活动月/1498.txt | ||
code/2006校园文化活动月/2006校园文化活动月.rar | ||
code/2006校园文化活动月 | ||
code/Bridging signals(DP(NlogN)).cpp | ||
code/zju 2531 Traveller(格雷码).cpp | ||
code/pku 2890 matrix multiplication(传递闭包).cpp | ||
code/zju 1039 Number Game(博弈搜索).cpp | ||
code/A Number Puzzle(dfs+hash).cpp | ||
code/A Simple Math Problem(矩阵二分).cpp | ||
code/Digital Deletions(博弈搜索).cpp | ||
code/copying books(DP).cpp | ||
code/A Chess Game(博弈SG).cpp | ||
code/find the mincost route(最短路).cpp | ||
code/I Hate It(linle版).cpp | ||
code/I Hate It(模板改进版).cpp | ||
code/I Hate It(线段树) .cpp | ||
code/Idiomatic Phrases Game(最短路).cpp | ||
code/Sum It Up(dfs生成不重复组合).cpp | ||
code/Northcott游戏(博弈SG).cpp | ||
code/Palindromes.cpp | ||
code/Permutation(递推).cpp | ||
code/S-Nim(博弈SG).cpp | ||
code/push box(bfs).cpp | ||
code/Spring-outing Decision(2).cpp | ||
code/Wall(计算几何).cpp | ||
code/诡异的楼梯(bfs).cpp | ||
code/美观化文字.cpp | ||
code/取石子游戏(bash&wythoff&nim).cpp | ||
code/Where is the little Jgshining(三角形外接圆圆心).cpp | ||
code/排列组合(二)(指数型母函数).cpp | ||
code/排列组合(指数型母函数).cpp | ||
code/一个人的旅行(最短路).cpp | ||
code/逃离迷宫(dfs).cpp | ||
code/取石子游戏(wythoff奇异局势的判断).cpp | ||
code/大明A+B .cpp | ||
code/Ping(普通bfs,优先队列bfs).cpp | ||
code/max sum plus plus(DP).cpp | ||
code/Cupid's Arrow(计算几何) .cpp | ||
code/Bubble Shooter(dfs).cpp | ||
code/txt_cpp.bat | ||
code/Chinese remainder theorem again(数论).cpp | ||
code/Doing Homework again(贪心).cpp | ||
code/GCD Again(欧拉函数).cpp | ||
code/A New Change Problem(互质数最大不可能数).cpp | ||
code/Solitaire(双向bfs+状态压缩).cpp | ||
code/Intervals(差分约束).cpp | ||
code/Invitation Cards(Bellman ford优化).cpp | ||
code/Cashier Employment(差分约束).cpp | ||
code/King(差分约束).cpp | ||
code/Monthly Expense(二分查找+贪心).cpp | ||
code/Cow Traffic(dfs求边通过次数).cpp | ||
code/Schedule Problem(差分约束).cpp | ||
code/Collect More Jewels(bfs+dfs).cpp | ||
code/胜利大逃亡(续)(bfs+状态hash).cpp | ||
code/Balanced Lineup(线段树).cpp | ||
code/Frequent values(线段).cpp | ||
code/Ellipse(椭圆截面积).cpp | ||
code/Frequent values(线段树).cpp | ||
code/超级密码(bfs).cpp | ||
code/Burn the Linked Camp(差分约束).cpp | ||
code/Square(dfs).cpp | ||
code/XYZZY(Bellman ford).cpp | ||
code/Calendar Game(博弈搜索).cpp | ||
code/hit1917 Peaceful Commission(2-SAT | O(nm)).cpp | |
code/Popular Cows(强连通分量Kosaraju).cpp | ||
code/Magic Bean(矩阵二分).cpp | ||
code/Popular Cows(强连通分量Gabow).cpp | ||
code/A New Tetris Game(2)(博弈SG).cpp | ||
code/Rank of Tetris(拓扑排序+集合).cpp | ||
code/hit1917 Peaceful Commission(2-SAT | O(m)).cpp | |
code/hit1917 Peaceful Commission(2-SAT | O(m))2.cpp | |
code/Going from u to v or from v to u(强连通分量).cpp | ||
code/Building roads(二分+2-SAT).cpp | ||
code/Get Luffy Out(2-SAT).cpp | ||
code/Stake Your Claim(博弈极大极小).cpp | ||
code/Victoria的舞会3(顶点数最小点基).cpp | ||
code/FatMouse's Speed(DP).cpp | ||
code/Pairs of integers(构造).cpp | ||
code/Beautiful People(DP O(NlogN)).cpp | ||
code/Maximum Clique(最大团).cpp | ||
code/Graph Coloring(最大独立集).cpp | ||
code/Air Raid(DAG最小路径覆盖).cpp | ||
code/Asteroids(二分图最小顶点覆盖).cpp | ||
code/Card Game Cheater(最大二分匹配).cpp | ||
code/Girls and Boys(二分图最大独立集).cpp | ||
code/Machine Schedule(二分图最小顶点覆盖).cpp | ||
code/Purifying Machine(二分图最大匹配 | 建图很重要).cpp | |
code/Summer Holiday(顶点数最小点基和权最小点基).cpp | ||
code/Minimum Inversion Number(逆序数).cpp | ||
code/Play on Words(欧拉图,半欧拉图判定).cpp | ||
code/Biorhythms(中国剩余定理).cpp | ||
code/Long Long Message(后缀数组,lcp).cpp | ||
code/Marriage is Stable(稳定婚姻匹配).cpp | ||
code/Milk Patterns(后缀数组,lcp,k重复).cpp | ||
code/Musical Theme(后缀数组,lcp,二分枚举).cpp | ||
code/University Entrace Examination(稳定婚姻匹配).cpp | ||
code/Catenyms(欧拉路,输出路径).cpp | ||
code/Farey Sequence(farey序列数).cpp | ||
code/Balanced Lineup(标准RMQ-ST).cpp | ||
code/Farey Sequence(朴素构造).cpp | ||
code/Farey Sequence(递归造树).cpp | ||
code/Cake Share(farey递归造树).cpp | ||
code/Picnic Planning(度限制最小生成树).cpp | ||
code/青蛙的约会(扩展欧几里德).cpp | ||
code/The Unique MST(prime,次小生成树判定).cpp | ||
code/Desert King (最优比率生成树).cpp | ||
code/The Bottom of a Graph(强连通分量).cpp | ||
code/Network(割点).cpp | ||
code/Burning Bridges(割边,有平行边).cpp | ||
code/Repairing Company(DAG最小路径覆盖).cpp | ||
code/Uncle Tom's Inherited Land(二分匹配).cpp | ||
code/Going Home(带权二分匹配KM O(N^4)).cpp | ||
code/Place the Robots(二分匹配).cpp | ||
code/A Plug for UNIX(ford_forlkerson).cpp | ||
code/Drainage Ditches(ford_forlkerson)O(VE^2).cpp | ||
code/Drainage Ditches(high_label_preflow_push)O(V^2E).cpp | ||
code/Kadj Squares(模拟).cpp | ||
code/Minimum Cost(带权二分匹配KM算法).cpp | ||
code/Farm Irrigation(dfs).cpp | ||
code/Atlantis(线段树求矩形并).cpp | ||
code/Gopher II(二分匹配).cpp | ||
code/Luck and Love(二维线段树).cpp | ||
code/PIGS(最大流,建图需要思考).cpp | ||
code/Atlantis(离散化N^3).cpp | ||
code/覆盖的面积(线段树矩形交).cpp | ||
code/Picture(线段树测度,独立线段数).cpp | ||
code/Paint the Wall(矩形离散化).cpp | ||
code/Picture(线段树离散两次).cpp | ||
code/Happy Children’s Day(RMQ线段树成段更新).cpp | ||
code/Matrix Searching(二维静态RMQ二维线段树实现).cpp | ||
code/Count the Colors(zoj涂色线段数,线段树).cpp | ||
code/Inversion(构造逆序数用线段树).cpp | ||
code/Inversion(求逆序数,逆序数求序列,用线段树).cpp | ||
code/Minimum Inversion Number(线段树求逆序数).cpp | ||
code/Count Color(poj区间颜色数,线段树).cpp | ||
code/Bandwidth(dfs剪枝).cpp | ||
code/Sticks(dfs,强剪枝).cpp | ||
code/Cipher(置换群,找循环节).cpp | ||
code/Count the Tetris(置换群).cpp | ||
code/Cow Sorting(置换群,最小花费置换).cpp | ||
code/Let it Bead(polya).cpp | ||
code/Minimum Transport Cost(最短路+字典序最小路径).cpp | ||
code/Necklace of Beads(置换群,polya).cpp | ||
code/Permutations(找循环节).cpp | ||
code/whu1018-King Kong(置换群,找循环节).cpp | ||
code/Crazy Thairs(线段树求逆序数).cpp | ||
code/The Unique MST(最小生成树,次小判定).cpp | ||
code/Arctic Network(最小生成树).cp |
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.