搜索资源列表
max-subrectangle
- POJ 52 —— To The Max求子矩阵的所有元素和的最大值-POJ 52- To The Max Qiuzi matrix elements and the maximum
raid
- POJ 2659 Raid 分治法解决两组点中距离最近的点对-POJ 2659 Raid divide-and-conquer method to solve the two sets of points to the nearest point on the
AfterEarthquake
- POJ 5441——“地震之后”解决有向图的最小生成树问题，输入N个村子坐标，M条可以建立的单向通信线路，选择一些通信线路使从总部发出的命令可以到达所有村子，并且线路总长最小，输出最小长度-POJ 5441- " After the earthquake" solution to the minimum spanning tree problem
Flip-Game
- POJ 755——Flip Game 有一块4*4的棋盘，每个格子上有一个黑色或白色的棋子，翻转一个棋子会使这个棋子及周围的4个棋子变为相反的颜色，给定棋盘的初始状态，求将棋盘中的格子都变为黑色或白色的最少翻转次数。-POJ 755- Flip Game has a 4* 4 chessboard, each grid on a black or white piece, flip a pawn makes this piece and around 4 pawn becomes the opp
yuanma
- POJ代码。对学习ＡＣＭ十分有用。欢迎大家下载。孟春雷上传。-POJ source
segment-tree
- 线段树例题,POJ上面的一些经典例题，这几天的心血。-Some of the classic examples of the segment tree example, POJ above, a few days of hard work.
_3069
- 可以为在pOJ上练习的同学做入门使用，这些代码全部通过-The for students practice in pOJ, do entry-use, all these codes by
cold-blood
- poj 冷血格斗场ac代码，郭伟程序设计实习课，poj ac-the poj cold-blooded fighting Stadium ac code, the Guo Wei programming practicum, poj ac
2803
- POJ 2803 Defining Moment
QuickSort_hoare
- 该源码是快速排序之霍尔排序，C++实现的，在POJ上面测试过了！-The source code is the quicksort hall the sort, C++ achieve the above in POJ tested!
quickSort_randsort
- 该源码是快速排序之随机选择排序，C++实现，POJ上测试过-The source code is quicksort the random selection sort, C++ achieve POJ tested
Triangle-War
- poj上只有三道极小极大算法的习题，poj1085是其中之一，并做了相关优化，时间：63ms-solve the poj 1085
The-inverse-expression-of-Poland
- POJ经典难题——逆波兰表达式VC++解答，附详细代码注释，初学必备-POJ classic problem- the Reverse Polish expression VC++ of answers, with detailed code comments, beginner must
The-mirror-maze
- POJ经典名题——镜子迷宫，搜索类题目经典做法，尤其注意边界条件讨论-The POJ classic title- Mirror Maze, search topics classic approach, particular attention to the boundary conditions discussed
Subway-planning2
- POJ经典名题——Subway planning，动态规划典型例题，含详细代码注释的VC++实现-POJ classic question- Subway planning, dynamic programming classic title, meaning detailed code comments VC++ to achieve
A-Knights-Journey
- POJ经典名题——骑士巡游VC++版实现附代码注释。初学者理解深搜思想很好地入门题目-The POJ classic title- Knight Parade VC++ Edition attached code comments. Beginners to understand the thinking of the deep search entry subject
1087
- 北京大学acm题库poj 1087题 一道图论题 -poj No.1451
BinaryIndexedTrees_solved
- 树状数组的样例程序，能够解决poj、ural的Stars问题-Tree array sample program that can solve poj, ural Stars
kfq
- 北大测评系统poj上面的一些ACm题目的c++代码，这是个人所写，ac过了-Beijing University evaluation system poj some of the above topics c++ ACm code, which is written by individuals, ac over
1001_2
- 高精度算法北大poj的1001题 算法还不错，凑齐20字，实在是难啊-Precision arithmetic