acm最短路
关注
分享
扫一扫
文章平均质量分 84
JustSteps
这个作者很懒，什么都没留下…
展开
-
hdu 1596最短路
#include#include#include#define INF 100000000using namespace std;double map[1005][1005];double d[1005];int vis[1005];struct cmp{ bool operator()(int lh,int rh) { return d[lh]<原创 2012-12-01 13:05:01 · 705 阅读 · 0 评论 -
hdu2923
EinbahnstrasseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1331 Accepted Submission(s): 364Problem DescriptionEinbahnstra原创 2013-04-08 20:14:41 · 1049 阅读 · 0 评论 -
hdu1546 dijkstra
理解了题不难#include #include #include #define inf 99999999using namespace std;int map[1005][1005];char dic[1005][1000];int w[1005];int vis[1005];int d[1005];int n;int dijkstra(){ memset(v原创 2013-04-08 18:48:49 · 896 阅读 · 0 评论 -
hdu 3339 最短路+01背包
In ActionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2557 Accepted Submission(s): 838Problem DescriptionSince 1945, whe原创 2013-04-09 23:11:37 · 1126 阅读 · 0 评论 -
hdu2807
The Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1525 Accepted Submission(s): 475Problem DescriptionThere are原创 2013-04-10 13:56:50 · 1188 阅读 · 0 评论 -
hdu1595 dijkstra
find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 763 Accepted Submission(s): 258Problem Descriptio原创 2013-04-10 15:10:26 · 1945 阅读 · 0 评论 -
hdu1839 二分+最短路
Delay Constrained Maximum Capacity PathTime Limit: 10000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 373 Accepted Submission(s): 149Problem D原创 2013-04-11 22:26:34 · 1648 阅读 · 0 评论 -
hdu1599 无向图最小环
find the mincost routeTime Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1164 Accepted Submission(s): 463Problem Description杭州有N原创 2013-04-11 21:14:37 · 2845 阅读 · 0 评论 -
hdu3986
Harry Potter and the Final BattleTime Limit : 5000/3000ms (Java/Other) Memory Limit : 65536/65536K (Java/Other)Total Submission(s) : 21 Accepted Submission(s) : 4Problem Description原创 2013-04-12 22:40:41 · 1102 阅读 · 0 评论 -
hdu1384差分约束
http://acm.hdu.edu.cn/showproblem.php?pid=1384题目看了半天~~思路：http://acm.miyuoo.com/2011/08/05/poj-1201hdu-1384-intervals-%E5%B7%AE%E5%88%86%E7%BA%A6%E6%9D%9F-spfa.html#include #include #include原创 2013-07-01 14:06:38 · 1163 阅读 · 0 评论 -
hdu1535 spfa
Invitation CardsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1202 Accepted Submission(s): 520Problem DescriptionIn the ag原创 2013-04-08 16:31:39 · 2295 阅读 · 1 评论 -
hdu1317 bellman-ford+floyd
XYZZYTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1461 Accepted Submission(s): 361Problem DescriptionIt has recently been原创 2013-04-08 15:20:48 · 2737 阅读 · 0 评论 -
hdu 2544 最短路问题
Dijstra: 使用优先队列#include#include#include#define INF 100000000using namespace std;int map[1005][1005];int d[1005];int vis[105];struct cmp{ bool operator()(int a,int b) { re原创 2012-11-29 16:59:23 · 519 阅读 · 0 评论 -
hdu 2680 dijkstra 使用优先队列优化
http://acm.hdu.edu.cn/showproblem.php?pid=2680处理的时候有个小技巧#include #include #include #include #define INF 100000000using namespace std;int map[1005][1005];int d[1005];int vis[1005];void i原创 2013-01-25 15:51:11 · 1027 阅读 · 0 评论 -
hdu 1385 floyd 最短路
#include #include #define MAX 1005#define INF 10000000using namespace std;int d[MAX][MAX];int path[MAX][MAX]; //路径int cost[MAX];void floyd(int n){ int i,j; for(i=1;i<=n;i++)原创 2013-01-25 19:56:59 · 436 阅读 · 0 评论 -
hdu1142
这道题纠结了好久~~~最后发现最短路的算法求错了~~~可是以前用此代码AC了好几道题了~~~汗~~求指点~先是最后ac代码：#include #include #include #include #define INF 1000010010using namespace std;int d[1005];int vis[1005];int w[1005][1005];原创 2013-02-03 13:21:51 · 1315 阅读 · 0 评论 -
hdu1548
用广搜 注意是有向图 #include #include #include #include #define INF 222222222using namespace std;int map[205][205];int d[205];int vis[205];void init(int n){ int i; for(i=0;i<=n;i++) {原创 2013-02-03 19:16:47 · 1062 阅读 · 0 评论 -
hdu2433 bfs+优化
TravelTime Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1120 Accepted Submission(s): 381Problem Description One day, Tom原创 2013-04-05 22:40:21 · 2490 阅读 · 0 评论 -
hdu 3873 dijkstra
Invade the MarsTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 365768/165536 K (Java/Others)Total Submission(s): 794 Accepted Submission(s): 236Problem DescriptionIt's now t原创 2013-04-06 22:54:58 · 1171 阅读 · 0 评论 -
hdu3631 floyd
Shortest PathTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3229 Accepted Submission(s): 767Problem DescriptionWhen YY was a原创 2013-04-06 19:55:44 · 1830 阅读 · 0 评论 -
hdu 3832
仔细分析一下就会发现就是求最短路问题，一直想着会把点重复算~~看了别人的代码 发现不会~~#include #include #include #include #include #define inf 99999999using namespace std;int map[205][205];struct node{ int x,y,r;};node a[20原创 2013-04-07 22:57:17 · 1185 阅读 · 0 评论 -
hdu1531 差分约束
http://acm.hdu.edu.cn/showproblem.php?pid=1531 差分约束关键是建立模型，而这是最难的~~~~感觉理解还是不深。。#include #include #include #include #define inf 0x3f3f3f3fusing namespace std;const int MAXM=20005;const i原创 2013-07-01 15:34:44 · 886 阅读 · 1 评论