shortest

HDU 3585 Maximum Shortest Distance 最大团 二分答案

%%% http://www.cnblogs.com/zhj5chengfeng/archive/2013/07/29/3224092.html平面上有N个点，确定k个点使其中各点对距离的最小值最大。有多组数据。这个最优化问题本身似乎不好解决，所以还是二分一下吧。。如果已知距离的最小值mid，判定是否存在k个点且两两距离均超过mid。将距离超过mid的点连起来求一下最大团即可。二分的时候跪了。。判
huanghongxun·2016-02-11 14:00

LeetCode Shortest Word Distance III

原题链接在这里：https://leetcode.com/problems/shortest-word-distance-iii/类似ShortestWordDistance.若是两个指针p1和p2相等时
Dylan_Java_NYC·2016-02-11 10:00

LeetCode Shortest Word Distance II

原题链接在这里：https://leetcode.com/problems/shortest-word-distance-ii/类似ShortestWordDistance.method会被call好多次
Dylan_Java_NYC·2016-02-11 09:00

LeetCode Shortest Word Distance

原题链接在这里：https://leetcode.com/problems/shortest-word-distance/TimeComplexity:O(n).Space:O(1).ACJava:1publicclassSolution
Dylan_Java_NYC·2016-02-11 04:00

POJ 2001 Shortest Prefixes (字典树)

ShortestPrefixesTimeLimit: 1000MS MemoryLimit: 30000KTotalSubmissions: 16531 Accepted: 7180DescriptionAprefixofastringisasubstringstartingatthebeginningofthegivenstring.Theprefixesof"carbon"are:"c","c
aozil_yang·2016-02-06 10:00

poj_2001 Shortest Prefixes（Trie树应用）

【题目】点击这里【思路】Trie树基本应用，先建树，而后对每个字符串查询，在查询过程中，取第一次碰到的尾缀单词数为1的结点之前的字符串作为前缀，如果查询完都没有，则取本身为前缀。【代码】#include #include #include typedefstructnode { charch; intnum; structnode*fChild,*rCousin; }*triNode; tri
cleopard66·2016-02-05 23:00

poj2001 Shortest Prefixes (trie树)

DescriptionAprefixofastringisasubstringstartingatthebeginningofthegivenstring.Theprefixesof"carbon"are:"c","ca","car","carb","carbo",and"carbon".Notethattheemptystringisnotconsideredaprefixinthisprobl
Kirito_Acmer·2016-02-05 22:00

HDU 4725 —— The Shortest Path in Nya Graph

原题：http://acm.hdu.edu.cn/showproblem.php?pid=4725题意：有n个点，n个层，相邻层之间花费为c；有额外的m条路，这m条路是直接点与点相连的，花费为w；问从1走到n的最小花费，若无法到达，则输出-1；注意：一层可以有多个点，同一层中，点与点的距离不是0，而是w；思路：我们将点拆成3n，1~n表示的就是点，另外2n则是用来表示层，每个层拆成两个点n+2*i
L_avender·2016-02-03 19:00

hdu 4725 The Shortest Path in Nya Graph //spfa

题意：一张无向图，有个n点，每个点属于一层，每层之间的距离为c，另有m条边连接其中的一些点，求第一个点到第n个点的最短距离；这题实在憋了很久，由于n和m都比较大，一开始就想到了spfa，但没考虑空层的情况，只用了n个点，每两个邻近点都用c的边连起来了，wa；后改成2*n个点，前n个点就为题中的n个点，连接m条边。后n个点代表n层，若相邻两层都含有点，则用c的边连起来。每个点和相对的层用0的边连起来
zchahaha·2016-01-22 19:00

ZOJ 2760 How Many Shortest Path （最小费用最大流做法）

DescriptionGivenaweighteddirectedgraph,wedefinetheshortestpathasthepathwhohasthesmallestlengthamongallthepathconnectingthesourcevertextothetargetvertex.Andiftwopathissaidtobenon-overlapping,itmeanstha
qq_26564523·2016-01-22 15:00

HDU 4725 The Shortest Path in Nya Graph(好题)

题目链接：kuangbin带你飞专题四最短路练习P-TheShortestPathinNyaGraph题意共n个点，n层(每个点单独一层)，相邻的两层之间权值为w还有m条额外的边，权值为v，求1到n的最短路思路本题可谓好题。时间空间都卡的相当死，硬把我从timeout逼到memorylimit。在求最短路上，本题没有什么难度，dijkstra＋heap或者spfa邻接表都行。但是在建图上，我一开始
to_be_better·2016-01-20 15:00

POJ2001 Shortest Prefixes(字典树)

题解：查找并输出字符串在串集里面唯一确定的最短前缀代码#include #include #include #include #include #include #include #include #include #include #include #include #include usingnamespacestd; #definemaxn10000 #defineLLlonglong in
qq_21057881·2016-01-16 14:00

HDU 2807 The Shortest Path 把矩阵抽象成点+Floyd

题意：有n个m*m的矩阵，设矩阵A,B,C，如果A*B=C表示从A到B有一条权值为1的边。有q次询问，如果第i个矩阵到第j个矩阵有路径，则输出最短，无则输出sorry。想法：比较简单，矩阵抽象为点，寻求，矩阵之间的单向关系，然后建边，题目询问可能很大，显然Floyd。spfa为单源最短路，需要枚举，所以耗时。#include #include #include #defineinf11111111
Triple_WDF·2016-01-13 16:00

hdu 1595 find the longest of the shortest （Dijkstra+路径处理）

ProblemDescriptionMaricaisveryangrywithMirkobecausehefoundanewgirlfriendandsheseeksrevenge.Sinceshedoesn'tliveinthesamecity,shestartedpreparingforthelongjourney.Weknowforeveryroadhowmanyminutesittakes
wqy20140101·2016-01-11 15:00

【poj2001】Shortest Prefixes 字典树

DescriptionAprefixofastringisasubstringstartingatthebeginningofthegivenstring.Theprefixesof“carbon”are:“c”,“ca”,“car”,“carb”,“carbo”,and“carbon”.Notethattheemptystringisnotconsideredaprefixinthisprobl
LOI_DQS·2016-01-07 10:00

[PTA] 4-11 Shortest Path [1] (25分)

#include #include typedefenum{false,true}bool; #defineMaxVertexNum10/*maximumnumberofvertices*/ typedefintVertex;/*verticesarenumberedfrom0toMaxVertexNum-1*/ typedefstructAdjVNode*PtrToAdjVNode; str
ZJU_fish1996·2016-01-06 12:00

Leetcode: Shortest Distance from All Buildings

QuestionShortestDistancefromAllBuildingsMySubmissionsQuestionTotalAccepted:919TotalSubmissions:3251Difficulty:HardYouwanttobuildahouseonanemptylandwhichreachesallbuildingsintheshortestamountofdistance
ayst123·2016-01-05 09:00

hihocoder 1107 : Shortest Proper Prefix

题目大意给定N个单词，求满足下列条件的前缀集合S：集合中任意前缀对应的单词数量小于等于5对于集合中任意前缀p，p的扩展前缀不属于该集合对于第二个条件，举个例子来说：假设ab对应了5个单词，abc对应了3个单词，abd对应了2个单词。因为ab对应的单词数量少于等于5，所以ab属于集合S。虽然abc和abd对应的单词数量均小于等于5，但由于其为ab的扩展，所以不属于S。解题思路由于本题需要询问多个单词
hexianhao·2015-12-27 18:00

[PTA] Week 11 4-16 Shortest Path [3] (25分)

#include #include typedefenum{false,true}bool; #defineINFINITY1000000 #defineMaxVertexNum10/*maximumnumberofvertices*/ typedefintVertex;/*verticesarenumberedfrom0toMaxVertexNum-1*/ typedefintWeightTy
ZJU_fish1996·2015-12-26 15:00

Shortest Distance from All Buildings

题目：Givenastringarray words,findthemaximumvalueof length(word[i])*length(word[j]) wherethetwowordsdonotsharecommonletters.Youmayassumethateachwordwillcontainonlylowercaseletters.Ifnosuchtwowordsexist,r
YRB·2015-12-23 11:00

LeetCode "Shortest Distance from All Buildings"

Nothingmagichere.JustBFS,but-BFSfromlandisnotagoodidea-BFSfromBuildings.Lessonlearnt:reversethinkinghelps!classSolution{ public: intshortestDistance(vector>&grid) { intret=0; //Getdimension in
Tonix·2015-12-22 07:00

[leetcode] Shortest Palindrome 解题报告

题目链接：https://leetcode.com/problems/shortest-palindrome/GivenastringS,youareallowedtoconvertittoapalindromebyaddingcharactersinfrontofit.Findandreturntheshortestpalindromeyoucanfindbyperformingthistran
qq508618087·2015-12-19 05:00

[LeetCode317]Shortest Distance from All Buildings

Youwanttobuildahouseonanemptylandwhichreachesallbuildingsintheshortestamountofdistance.Youaregivena2Dgridofvalues0,1or2,where: Each0marksanemptylandwhichyoucanpassbyfreely. Each1marksabuildingwhichyo
u012175043·2015-12-17 03:00

[LeetCode] Shortest Distance from All Buildings

之前听朋友说LeetCode出了一道新题，但是一直在TLE，我就找时间做了一下。这题是一个比较典型的BFS的题目，自己匆忙写了一个答案，没有考虑优化的问题，应该是有更好的解法的。基本想法就是从每个数值为1的点做bfs，遇到为0的点就加上相应的距离。这题因为要求到所有1的距离和最小的点，所以就可以无脑iterateover所有数值为1的点，并开一个二维数组来记录各个点的累加距离值。最后要检查一下所有
_icecream·2015-12-15 15:00

leetcode -- Shortest Palindrome -- 不太理解

https://leetcode.com/problems/shortest-palindrome/solution:http://bookshadow.com/weblog/2015/05/22/leetcode-shortest-palindrome
xyqzki·2015-12-08 20:00

Dijkstra+Heap-HDU-4725-The Shortest Path in Nya Graph

TheShortestPathinNyaGraphTimeLimit:2000/1000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):4297AcceptedSubmission(s):999ProblemDescriptionThisisaveryeasyproblem,yourtaskisjustc
Roy_Yuan·2015-12-07 01:00

[LeetCode245] Shortest Word Distance III

ThisisafollowupofShortestWordDistance.Theonlydifferenceisnowword1couldbethesameasword2. Givenalistofwordsandtwowordsword1andword2,returntheshortestdistancebetweenthesetwowordsinthelist. word1andword
u012175043·2015-11-24 07:00

[LeetCode244]Shortest Word Distance II

ThisisafollowupofShortestWordDistance.Theonlydifferenceisnowyouaregiventhelistofwordsandyourmethodwillbecalledrepeatedlymanytimeswithdifferentparameters.Howwouldyouoptimizeit? Designaclasswhichreceiv
u012175043·2015-11-24 07:00

[LeetCode243]Shortest Word Distance

Givenalistofwordsandtwowordsword1andword2,returntheshortestdistancebetweenthesetwowordsinthelist. Forexample, Assumethatwords=["practice","makes","perfect","coding","makes"]. Givenword1=“coding”,wor
u012175043·2015-11-24 06:00

POJ 2001 Shortest Prefixes (字典树模拟切割)

ShortestPrefixesTimeLimit:1000MS MemoryLimit:30000KTotalSubmissions:16059 Accepted:6929DescriptionAprefixofastringisasubstringstartingatthebeginningofthegivenstring.Theprefixesof"carbon"are:"c","ca","
helloiamclh·2015-11-18 18:00

Method for finding shortest path to destination in traffic network using Dijkstra algorithm or Floyd-warshall

A method is presented for finding a shortest path from a starting place to a destination place in a traffic
·2015-11-13 20:43

Dual Dijkstra search for planning multiple paths

The dual Dijkstra search for planning multiple paths is performed by: (1) calculating a first shortest
·2015-11-13 20:42

POJ 2001 Shortest Prefixes(字典树）

题目地址：POJ 2001 考察的字典树，利用的是建树时将每个点仅仅要走过就累加。最后从根节点開始遍历，当遍历到仅仅有1次走过的时候，就说明这个地方是最短的独立前缀。然后记录下长度，输出就可以。 代码例如以下： #include <iostream> #include <stdio.h> #include <string.h> #include <
·2015-11-13 18:08

【leetcode】Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-11-13 18:28

UVA Knight Moves

A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest
·2015-11-13 18:24

leetcode------Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the
·2015-11-13 15:32

线段树查询模板(POJ 3264)

;iostream> #include <cstdio> using namespace std; struct heights { long tallest, shortest
·2015-11-13 15:01

HDU 4725 The Shortest Path in Nya Graph-【SPFA最短路】

题目：http://acm.hdu.edu.cn/showproblem.php?pid=4725 题意：有N个点和N层..一层有X个点(0<=X<=N).两邻两层间有一条路花费C。还有M条小路在两个点之间。问从第一个点走到第N个点最短路是多少... 题解：依然是在点之间SPFA。不过在跑的时候不仅要跑与当前点相连接的点。还有把当前点所在层的相邻层的点判断是否加入队列.
·2015-11-13 15:11

Java Word Ladder(字梯)

问题： Given two words (start and end), and a dictionary, find the length of shortest transformation sequence
·2015-11-13 14:21

Shortest Subchain

http://acm.timus.ru/problem.aspx?space=1&num=1651 题意：给出链上点的顺序  要求找一条子链 满足三个条件 1，起点和终点和原链一样 2，边的顺序和原始顺序一致 3，最短 思路： 如果去掉第二个条件的话 就变成了最简单的最短路了  由于第二个条件的限制 要按给的边的顺序依次更新 然后重要的就是记录路径 代码
·2015-11-13 13:46

Leetcode | Word Ladder

Given two words (start and end), and a dictionary, find the length of shortest transformation sequence
·2015-11-13 13:45

Leetcode | Minimum/Maximum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-11-13 13:40

LeetCode | Word Ladder II

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from
·2015-11-13 13:25

Giraph之SSSP（shortest path）单机伪分布运行成功

  所遇问题：Exception 1： Exception in thread "main" java.lang.IllegalArgumentException: "checkLocalJobRunnerConfiguration: When using"LocalJobRunner, must have only one worker si
·2015-11-13 10:58

Run Example in Giraph: Shortest Paths

转自：https://marsty5.wordpress.com/2013/04/29/run-example-in-giraph-shortest-paths/ Run Example in Giraph
·2015-11-13 10:41

Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-11-13 08:43

hdu4725 The Shortest Path in Nya Graph

这道题看了下很多人都是把每一层拆成两个点然后建图做的。 我的思路很直接，也不用建图，直接在更新每个点时更新他相邻的边和相邻的层，当然前提是每个点只更新一次，每个层也只更新一次，这样才能确保时间复杂度。 这里我用了两个邻接表，一个是邻接边，一个是邻接层，最后用优先队列优化下。 下面是代码   #include<stdio.h> #include<string.
·2015-11-13 07:15

[LeetCode]Minimum Depth of Binary Tree

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest
·2015-11-13 07:59

hdu 2807 The Shortest Path

http://acm.hdu.edu.cn/showproblem.php?pid=2807  第一次做矩阵乘法，没有优化超时，看了别人的优化的矩阵乘法，就过了。 1 #include <cstdio> 2 #include <iostream> 3 #include <cstring> 4 #include <algo
·2015-11-13 05:27

hdu 1595 find the longest of the shortest

http://acm.hdu.edu.cn/showproblem.php?pid=1595 这道题我用spfa在枚举删除边的时候求最短路超时，改用dijkstra就过了。 1 #include <cstdio> 2 #include <queue> 3 #include <cstring> 4 #include <alg
·2015-11-13 05:14
上一页 8 9 10 11 12 13 14 15 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他