本月博客排行
-
第1名
龙儿筝 -
第2名
lerf -
第3名
fantaxy025025 - johnsmith9th
- xiangjie88
- zysnba
年度博客排行
-
第1名
青否云后端云 -
第2名
宏天软件 -
第3名
gashero - wy_19921005
- vipbooks
- benladeng5225
- e_e
- wallimn
- javashop
- ranbuijj
- fantaxy025025
- jickcai
- gengyun12
- zw7534313
- qepwqnp
- 解宜然
- ssydxa219
- zysnba
- sam123456gz
- sichunli_030
- arpenker
- tanling8334
- gaojingsong
- kaizi1992
- xpenxpen
- 龙儿筝
- jh108020
- wiseboyloves
- ganxueyun
- xyuma
- xiangjie88
- wangchen.ily
- Jameslyy
- luxurioust
- lemonhandsome
- mengjichen
- jbosscn
- zxq_2017
- lzyfn123
- nychen2000
- forestqqqq
- wjianwei666
- ajinn
- zhanjia
- Xeden
- hanbaohong
- java-007
- 喧嚣求静
- mwhgJava
- kingwell.leng
最新文章列表
poj 1511 Invitation Cards
这个题的题意就是从1到所有点以及从所有点回到1所需最小的花费。这道题实质是求最短路径,我的思路是用SPFA,正反两次SPFA。对spfah还是第一次写,不知道怎么优化。
代码:
#include<iostream>
#include<queue>
using namespace std;
const int maxn=1000005,inf=100000000 ...
poj 1511 Invitation Cards
这个题的题意就是从1到所有点以及从所有点回到1所需最小的花费。这道题实质是求最短路径,我的思路是用SPFA,正反两次SPFA。对spfah还是第一次写,不知道怎么优化。
代码:
#include<iostream>
#include<queue>
using namespace std;
const int maxn=1000005,inf=100000000 ...
【最短路+spfa+有难度】杭电 hdu 2377 Bus Pass
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://ac ...
【最短路+dijkstra+floyd+spfa】1596 find the safest road
Dijkstra 算法
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : ...
【最短路+三种解法】杭电 hdu 1690 Bus System
Floyd 算法
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL ...
【最短路+dijkstra+spfa】杭电 hdu 2722 Here We Go(relians) Again
Dijkstra 解法
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : ht ...
【最短路+dijkstra+spfa】杭电 hdu 2962 Trucking
Spfa 解法
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http:/ ...
HDU 2722 Here We Go(relians) Again
Here We Go(relians) Again
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 162Accepted Submission(s): 99
Problem Description
The Gorelians are a wa ...