最短路
文章平均质量分 81
RIPwangh
山东理工大学本科学生
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
poj-2240-Arbitrage-最短路 BF
Total Submissions: 17765 Accepted: 7495DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same原创 2015-08-05 08:43:24 · 1045 阅读 · 0 评论 -
poj-1125-Stockbroker Grapevine-Floyd
Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the stock m原创 2015-08-04 21:18:11 · 720 阅读 · 0 评论 -
poj-1062昂贵的聘礼-Bellman-F
中文题,说一下思路,就是把冒险者当成0点,各个物品的价格就是到各个点的距离,然后用BF松驰,要枚举等级差距,因为比如 国王的等级为3,还有两个等级分别为4,2的人,等级限置为1,先与1交易,再与4交易,就是间接接触,所以要去枚举,国王等级不一定是最高的#include#include#include#define MAX 0x3f3f3fint m, n,cont;struc原创 2015-08-04 16:58:29 · 740 阅读 · 0 评论 -
poj-3259-Wormholes-BF
While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that i原创 2015-08-03 20:53:39 · 605 阅读 · 0 评论 -
poj-2253-Frogger-最短路
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30089 Accepted: 9708DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Fr原创 2015-08-04 20:00:04 · 1942 阅读 · 0 评论 -
poj-1860-Currency Exchange-Bellman
DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currenci原创 2015-08-03 19:31:56 · 479 阅读 · 0 评论 -
*poj-3083-Children of the Candy Corn-图的BFS DFS
The cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors on their que原创 2015-07-31 16:04:24 · 547 阅读 · 0 评论 -
HDU-2544-最短路-模板
//Dijkstra-感觉和prim很像,就是很像#include#include#include#define MAX 0x3f3f3fint map[150][150];int dis[150];int n;int bj[150];void dijkstra(){ memset(bj,0,sizeof(bj)); memset(dis,0,sizeof(d原创 2015-08-03 15:48:51 · 651 阅读 · 0 评论
分享