随笔分类 -  挑战程序设计竞赛2

挑战程序设计2 KD树
摘要：Range Query - Range Search (kD Tree) Time Limit : 1 sec, Memory Limit : 262144 KB Japanese version is here Range Query - Range Search (kD Tree) Range 阅读全文

posted @ 2017-11-01 21:42 ZefengYao 阅读(210) 评论(0) 推荐(0)

挑战程序设计2 矩阵链乘
摘要：Matrix Chain Multiplication Time Limit : 1 sec, Memory Limit : 65536 KB Japanese version is here Matrix Chain Multiplication Matrix-chain Multiplicati 阅读全文

posted @ 2017-10-29 22:22 ZefengYao 阅读(240) 评论(0) 推荐(0)

连通分量
摘要：Connected Components Write a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each 阅读全文

posted @ 2017-10-25 21:49 ZefengYao 阅读(973) 评论(0) 推荐(0)

深度优先搜索
摘要：Depth First Search Depth-first search (DFS) follows the strategy to search ”deeper” in the graph whenever possible. In DFS, edges are recursively expl 阅读全文

posted @ 2017-10-25 20:59 ZefengYao 阅读(409) 评论(0) 推荐(0)

导航