Location:
Search - poj a
Search list
Description: 该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the complexity of O (n* m).
Platform: |
Size: 3072 |
Author: 唐海浪 |
Hits:
Description: 解决时钟问题，acm竞赛题
A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15.
Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.-clock to solve the problem, acm contest A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you can not use any other kind. There are infinite number of coins of each kind, each marked with a number d (0 lt; = 1000), meaning that this coin will make the minute hand move clockwise d times the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s (0 lt; s = lt; = 59) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.
Platform: |
Size: 1024 |
Author: 王冠 |
Hits:
Description: poj上第1990题目源码，用到了2个树状数组，这题数据结构是关键，想到了题目就很简单了-poj first topic FOSS 1990, used the two tree arrays, which that data structure is the key, think of a very simple topic
Platform: |
Size: 1024 |
Author: zhao shan hai |
Hits:
Description: 问题：已经平面上的若干点，求包围这些点的最小包围长
度
算法：经典的凸包算法，注意求解时对最外圈做处理。-Question: has a number of points on the plane, and surrounded by the smallest of these points, surrounded by the length of algorithm: the classic convex hull algorithm, when attention to solving the most to do deal with the outer ring.
Platform: |
Size: 1024 |
Author: 苏钿煌 |
Hits:
Description: POJ1151 Atlantis的源代码，非常经典线段树应用的题目，求面积。-POJ1151 Atlantis source code, is a classic application of the subject tree line, and area.
Platform: |
Size: 1024 |
Author: zuobaojing |
Hits:
Description: POJ系统第1657题的源程序。在必要的地方附有程序说明-POJ system, the first 1657 title of the source. Where necessary with a description of the procedures
Platform: |
Size: 1024 |
Author: 李悦乔 |
Hits:
Description: 北大在线ACM系统中的经典解题方法思路还有源码。其中是按ACM中的题号作为标题的。-ACM System sharPKUngfu online classic problem-solving methods also source ideas. Which is based on ACM
Platform: |
Size: 2553856 |
Author: jackie |
Hits:
Description: poj AC的代碼，具有一定的參考價值，可以下載來看看，-poj AC code, has a certain reference value, you can download to look at,
Platform: |
Size: 67584 |
Author: MnO2 |
Hits:
Description: poj2187给一堆点,求出其中的最远点对,凸包的应用-poj2187 to a pile of points, obtained one of the furthest points right, the application of convex hull
Platform: |
Size: 1024 |
Author: cx |
Hits:
Description: poj3352给一个图,求出需要加最少的边使去掉任一条边,图都连通.割点的应用-poj3352 to a map, obtained at least the need to remove the edges so that any one side, map are connected. cut-point application
Platform: |
Size: 1024 |
Author: cx |
Hits:
Description: 总共80多道题的POJ详细解题报告，每道题带ppt说明，很好很强大
-A total of more than 80 questions the POJ report detailed problem-solving, with each title ppt shows that a good strong
Platform: |
Size: 3230720 |
Author: qiming |
Hits:
Description: 原理为:以数链思想,移动数组中的内容
使数组在没有扩充情况下,达成移动的效果
当然,有更简单的,大牛不要笑哦-The principle is: a few chain of thought, an array of mobile content so that the expansion of the array in the absence of circumstances, to achieve the effect of mobile Of course, there are more simple, do not laugh Oh Daniudi
Platform: |
Size: 1024 |
Author: 马超 |
Hits:
Description: 对北大poj试题详细分析并解答，适合程序竞赛初学者，对其他编程人员也有一定帮助-POJ the University to analyze and answer questions in detail, suitable for beginners contest procedures for other programmers to have a certain extent, help
Platform: |
Size: 436224 |
Author: 朱之城 |
Hits:
Description: poj解题报告，包括了许多很经典的算法-POJ problem solving reports, including a number of classic algorithms
Platform: |
Size: 5842944 |
Author: michael |
Hits:
Description: 不仅仅是浓缩，还是精华。POJ600多题的答案，本人长期在POJ战斗的成果。-Just concentrate, or essence. POJ600 answer more questions, I am a long-term outcome of the fighting in POJ.
Platform: |
Size: 4441088 |
Author: kuhot |
Hits:
Description: POJ 代码 里面有一千多道题的代码，是用C语言编辑器编译的正确代码，欢迎大家下载使用。-There are more than a thousand POJ code to problem code is compiled with the C language editor the correct code, welcome to download.
Platform: |
Size: 337920 |
Author: |
Hits:
Description: poj 1051 源代码。已经测试通过 AC-poj 1051 source code. Has been tested by AC
Platform: |
Size: 518144 |
Author: caoxulei |
Hits:
Description: 北京大学程序在线评测系统(POJ)中关于贪心算法的一个解题程序-Peking University program online evaluation system (POJ), a greedy algorithm on problem solving process
Platform: |
Size: 1024 |
Author: xiao |
Hits:
Description: 关于 poj 的几道动态规划题，线段树题后缀数组题-About poj a few dynamic programming questions, problems suffix array segment tree title
Platform: |
Size: 3072 |
Author: 吕伟涛 |
Hits:
Description: 关于 poj 的几道动态规划题，线段树题后缀数组题-About poj a few dynamic programming questions, problems suffix array segment tree title
Platform: |
Size: 3072 |
Author: chenag37e712 |
Hits: