shortest

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

[LeetCode]Word Ladder II

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

[LeetCode]Word Ladder

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

MMORPG programming in Silverlight Tutorial (9)KeyFrame Animation

    In the last chapter, I introduce A* algorithm, so the object can find the shortest
·2015-11-13 05:12

zoj2760（最大流）

  传送门：How Many Shortest Path 题意：给出n个点，和n*n的矩阵表示有向图。a[i][j]为-1表示i到j没有路径；不为-1则表示i到j的路径长度。
·2015-11-13 04:14

HDU 4725 The Shortest Path in Nya Graph（ 建图 + 最短路 ）

主要是建图，建好图之后跑一边dijkstra即可。 一共3N个点，1~N是原图中的点1~N，然后把每层x拆成两个点(N+x)[用于连指向x层的边]和(N+N+x)[用于连从x层指出的边]。 相邻层节点互相可达：AddEdge( N+N+x+1, N+x, C), AddEdge( N+N+x, N+x+1, C); 对于位于x层的节点i，AddEdge(N+x, i, 0), AddEdge
·2015-11-13 03:33

POJ2001 Shortest Prefixes 用trie树实现

题目：问你最短能构成前缀的且不包括已有的单词(当没有时为自己)的单词分析：用trie树做，动态构树，然后从根节点开始往下找，当找到之前是已经有单词或者该处的单词已经走过该节点，继续往下，直到这两个条件不成立为止#include <iostream>#include <cstring>#include <cstdio>using namespace std;str
·2015-11-13 03:26

K短路-有环版

p.s.这个A*比八数码好写多了…… 贴一下我的模板，如有错误之处欢迎大家指正 k-shortest-p
·2015-11-13 02:17

HDU 4725 The Shortest Path in Nya Graph（最短路径）（2013 ACM/ICPC Asia Regional Online ―― Warmup2）

Description This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this pa
·2015-11-13 02:26

《算法》C++代码 SPFA

       SPFA的全称是Shortest Path Faster Algorithm，一看名称八成就是中国人起的名字，因为外国人起算法名称一般都会写上自己的名字
·2015-11-13 01:50

[LeetCode#127]Word Ladder

恢复内容开始--- The problem: Given two words (start and end), and a dictionary, find the length of shortest
·2015-11-13 01:50

LeetCode: Minimum Depth of Binary Tree 解题报告

Tree Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest
·2015-11-13 00:08

LeetCode: Word Ladder解题报告

Word Ladder解题报告 Given two words (start and end), and a dictionary, find the length of shortest
·2015-11-13 00:03

LeetCode: Word Ladder II 解题报告

Word Ladder II Given two words (start and end), and a dictionary, find all shortest transformation
·2015-11-13 00:37

111. 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 00:00

ZOJ 2760 How Many Shortest Path（最短路径+最大流）

Description Given a weighted directed graph, we define the shortest path as the path who has the smallest
·2015-11-13 00:25

leetcode--Minimum Depth of Binary Tree

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

CSU 1506（最小费用最大流）

  传送门：Double Shortest Paths 题意：有两个人；给出路径之间第一个人走所需要的费用和第二个人走所需要的费用（在第一个人所需的 费用上再加上第二次的费用）；求两个人一共所需要的最小费用
·2015-11-12 23:58

LeetCode_Word Ladder

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

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-12 23:28

HDU4725 The Shortest Path in Nya Graph SPFA最短路

典型的最短路问题，但是多了一个条件，就是每个点属于一个layer,相邻的layer移动，如x层移到x+1层需要花费c. 一种显而易见的转化是我把这些边都建出来，但是最后可能会使得边变成O(n^2); 网上看到的一些做法就是拆点，假如我给每层做一个平台点，所有点都可以到这个平台，然后再换乘到别的平台里不就可以了吗？ 所以对于属于第i层的点我们构造一个i层点的虚拟点，把这些点连到这个平台点，花费为
·2015-11-12 22:57

Word Ladder

  1 题目 1 Given two words (start and end), and a dictionary, find the length of shortest transformation
·2015-11-12 22:26

【leetcode】Word Ladder II

  Word Ladder II Given two words (start and end), and a dictionary, find all shortest
·2015-11-12 21:13

【LeetCode】Minimum Depth of Binary Tree 二叉树的最小深度 java

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

HDU4871 Shortest-path tree(树分治)

好久没做过树分治的题了，对上一次做是在南京赛里跪了一道很裸的树分治题后学的一道，多校的时候没有看这道题，哪怕看了感觉也看不出来是树分治，看出题人给了解题报告里写了树分治就做一下好了。 题意其实就是给你一个图，然后让你转换成一棵树，这棵树满足的是根节点1到其余各点的距离都是图里的最短距离，而且为了保证这棵树的唯一性，路径也必须是最小的。转化成树的方法其实就是跑一次spfa。spfa的时候记下所有到
·2015-11-12 19:02

Shortest Subchain(bfs)

１６５１ 终于Ａ了　 看这题容易想到最短路　看到错的很多　还特意注意了好几处 后来发现　必须按给出的顺序出边　想了想　这不就是ＢＦＳ　 然后就是各种细节　ｉ－＞ｉ＋１ｏｒｉ－＞ｊ（ａ［ｉ］＝＝ａ［ｊ］） 　 1 #include <iostream> 2 #include<cstdio> 3 #include<cstring>
·2015-11-12 18:32

【leetcode】Word Ladder

My Submissions Given two words (start and end), and a dictionary, find the length of shortest
·2015-11-12 18:36

POJ-2001-Shortest Prefixes

POJ-2001-Shortest Prefixes http://poj.org/problem?
·2015-11-12 17:26

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-12 16:56

POJ 2001 Shortest Prefixes【第一棵字典树】

Description A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "car", "carb"
·2015-11-12 15:08

POJ 2677 Tour【DP】

To save money, John must determine the shortest closed tour th
·2015-11-12 15:44

boost图库简单操作

graph_traits.hpp> 2 #include <boost/graph/adjacency_list.hpp> 3 #include <boost/graph/dijkstra_shortest_paths.hpp
·2015-11-12 14:19

leetcode—word ladder II

1.题目描述 Given two words (start and end), and a dictionary, find all shortest transformation
·2015-11-12 13:09

shortest path first 程序的编写

错误信息（问题解决之后写的blog，拷贝了别人错误信息）： 1>f:\program files\microsoft visual studio 10.0\vc\include\cmath(19): error C2061: syntax error : identifier 'acosf'1>f:\program files\microsoft visual studio 10.0
·2015-11-12 13:49

贪心算法--Dijkstra单源最短路径

今天兴致勃勃的开始做了贪心算法的第一道题目：Single-Source Shortest-Paths Problem 也就是所谓的单源最短路径，课件上有算法，但是代码实现起来还真是不容易（仅仅对于我这个菜鸟来说
·2015-11-12 13:09

leetcode_question_111 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-12 13:54

程序设计竞赛问题类型

涉及的频率是由高到低的): 动态规划 Dynamic Programming 贪心 Greedy Complete Search Flood Fill 最短路 Shortest
·2015-11-12 12:33

Word Ladder II

Given two words (start and end), and a dictionary, find all shortest transformation sequence
·2015-11-12 11:16

Word Ladder

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

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-12 09:57

Word Ladder

Given two words (start and end), and a dictionary, find the length of shortest transformation
·2015-11-12 09:43

leetcode—word ladder II

1.题目描述 Given two words (start and end), and a dictionary, find all shortest transformation
·2015-11-12 09:43

hdu-----(2807)The Shortest Path(矩阵+Floyd)

The Shortest Path Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/
·2015-11-11 19:51

ACM学习历程—HDU4725 The Shortest Path in Nya Graph（SPFA && 优先队列）

Description This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this pa
·2015-11-11 18:47

最短路+网络流/sgu 185 Two shortest

题意 　　求一个无向图中没有重边的两条最短路，并输出方案 分析 　　注意，是两条最短路！不是一条最短一条次短！所以先来个dijkstra/spfa来算一下最短路 　　根据dijkstra/spfa求出的dist[i]数组，建立一个新图，上面只有所有满足最短路的边构成的图 　　这样，建图就Ok了，下面如何解决没有重边呢？ 　　很显然，设立一个源点和汇点，在源点出放出2的值。然后把刚刚建好
·2015-11-11 18:57

Shortest Prefixes 字典树

   virtual judge  树 A题 1 #include<stdio.h> 2 #include<stdlib.h> 3 #include<string.h> 4 struct node 5 { 6 int flag; 7 struct node *next[26]; 8
·2015-11-11 17:02

Why longest path problem doesn't have optimal substructure?

We all know that the shortest path problem has optimal substructure.
·2015-11-11 17:56

【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-11 17:49

poj 2001:Shortest Prefixes（字典树，经典题，求最短唯一前缀）

Shortest Prefixes Time Limit: 1000MS   Memory Limit: 30000K Total Submissions
·2015-11-11 17:08
上一页 9 10 11 12 13 14 15 16 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他