There are some acm algorithm, such as johnson algorithm, radix tree, dynamic programming, geometry, etc.

专题---szy
..........\2-SAT
..........\.....\2-sat.cpp
..........\.....\2-sat.dsp
..........\.....\2-sat.dsw
..........\.....\2-sat.ncb
..........\.....\2-sat.opt
..........\.....\2-sat.plg
..........\.....\Debug
..........\.....\.....\2-sat.pch
..........\.....\.....\vc60.idb
..........\.....\.....\vc60.pdb
..........\.....\sat2.pdf
..........\.....\注解.txt
..........\johnson 算法
..........\............\C.CPP
..........\............\johnson 算法.txt
..........\............\johnson算法.txt
..........\radix tree
..........\..........\RadixTrie.doc
..........\treap
..........\.....\treap简介.ppt
..........\几何
..........\....\!!!!!内切圆(incircle).cpp
..........\....\公式.txt
..........\....\判断圆是否在多边形内(CircleInsidePolygon).cpp
..........\....\圆
..........\....\..\两圆公共面积(c2area).cpp
..........\....\..\两圆关系(CircleRelation).cpp
..........\....\圆和直线关系(clpoint).cpp
..........\....\圆是否在矩形内(CircleRecRelation).cpp
..........\....\基本定义(POINT)(LINESEG)(LINE).cpp
..........\....\外接圆的外径的求法.txt
..........\....\多边形
..........\....\......\凸包graham 扫描法(Graham_scan).cpp
..........\....\......\凸包算法-Graham Scan.txt
..........\....\......\凸包算法-卷包法.txt
..........\....\......\判断多边形顶点凸凹性(checkconvex)凸多边形(isconvex).cpp
..........\....\......\判断多边形顶点排列方向(isconterclock).cpp
..........\....\......\卷包裹法求点集凸壳(ConvexClosure).cpp
..........\....\......\多边形是简单多边形(issimple).cpp
..........\....\......\多边形核(core_exist).cpp
..........\....\......\多边形面积(area_of_polygon).cpp
..........\....\......\求任意简单多边形的重心.txt
..........\....\......\求多边形内一点(a_point_insidepoly).cpp
..........\....\......\简单多边形重心(cg_simple)凸(gravitycenter).cpp
..........\....\多边形的直径.txt
..........\....\求三角形的外接圆半径.txt
..........\....\点、圆
..........\....\......\三点确定圆(cocircle).cpp
..........\....\......\两圆交点(c2point).cpp
..........\....\......\求点圆切点(cutpoint).cpp
..........\....\......\点在圆内(point_in_circle).cpp
..........\....\点、线
..........\....\......\两点求直线解析式(makeline).cpp
..........\....\......\判断点与多边形位置(insidepolygon)凸多边形(InsideConvexPolygon).cpp
..........\....\......\判断点在直线上(online).cpp
..........\....\......\求三点夹角(angle).cpp
..........\....\......\点关于直线的对称点(symmetry).cpp
..........\....\......\点到多边形的切线(pointtangentpoly).cpp
..........\....\......\点到折线集的最近距离(ptopointset).cpp
..........\....\......\点到线段所在直线垂足(perpendicular).cpp
..........\....\......\点到线段最短距离(垂距)(ptoldist).cpp
..........\....\......\点到线段最短距离(非垂距)(ptolinesegdist).cpp
..........\....\......\点是否在直线同侧(SameSide).cpp
..........\....\......\点逆时针旋转后位置(rotate).cpp
..........\....\点到平面的距离(P2planeDist).cpp
..........\....\球
..........\....\..\求球面上两点最短距离模板.txt
..........\....\矩形
..........\....\....\求矩形第四个顶点(rect4th).cpp
..........\....\....\矩形包含.cpp
..........\....\线、多边形
..........\....\..........\线段是否在多边形内(LinesegInsidePolygon).cpp
..........\....\线、线段
..........\....\........\判断直线相交(lineintersect).cpp
..........\....\........\判断线段(直线)相交(intersect)交点(intersection).cpp
..........\....\........\判断线段是否相交.txt
..........\....\........\叉积(判断方向)(multiply).cpp
..........\....\........\点积(判断角度)(dotmultiply).cpp
..........\....\........\线段的左右旋(rotat).cpp
..........\....\线、角
..........\....\......\两矢量夹角的余弦(cosine).cpp
..........\....\......\两线段间夹角(lsangle).cpp
..........\....\......\直线解析式求斜率(slope)及倾斜角(alpha).cpp
..........\....\补充.txt
..........\....\镜面反射线(reflect).cpp
..........\动态规划
..........\........\DP
..........\........\..\Bitonic旅行路线问题.mht
..........\........\..\Bitonic旅行路线问题解答.files
..........\........\..\.............................\banner.files
..........\........\..\.............................\............\Logo.gif
..........\........\..\.............................\............\algorith

• 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．