本月博客排行
-
第1名
宏天软件 -
第2名
kaizi1992 -
第3名
vipbooks - wallimn
- arpenker
- daizj
- xpenxpen
- zhangjijun
- sunnylocus
年度博客排行
-
第1名
青否云后端云 -
第2名
宏天软件 -
第3名
wy_19921005 - gashero
- gengyun12
- robotmen
- vipbooks
- fantaxy025025
- 大家都说我很棒
- wallimn
- hbxflihua
- qepwqnp
- e_e
- 解宜然
- ranbuijj
- javashop
- zw7534313
- ssydxa219
- jickcai
- sam123456gz
- gdpglc
- zysnba
- sichunli_030
- tanling8334
- appalese
- benladeng5225
- gaojingsong
- wiseboyloves
- zhangyi0618
- xpenxpen
- jh108020
- luxurioust
- xyuma
- nychen2000
- 龙哥IT
- arpenker
- wjianwei666
- wangchen.ily
- jbosscn
- lzyfn123
- 狂盗一枝梅
- java-007
- Jameslyy
- hanbaohong
- kaizi1992
- xiangjie88
- mengjichen
- silverend
- ajinn
- zxq_2017
最新文章列表
POJ 4370 0 or 1 图论模型的转化
这题的优点就在于模型的转化
转化完就是个非常简单的最短路了
显然,题目给的是一个0/1规划模型。 解题的关键在于如何看出这个模型的本质。 3个条件明显在刻画未知数之间的关系,从图论的角度思考问题,容易得到下面3个结论: 1.X12+X13+...X1n=1 于是1号节点的出度为1 2..X1n+X2n+...Xn-1n=1 于是n号节点的入度为1 3.∑Xki =∑Xij 于是2~n-1 ...
【最短路+bfs+剪枝】杭电 hdu 2433 Travel
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://ac ...
【最短路+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:/ ...
【最短路+dijkstra】杭电 hdu 2923 Einbahnstrasse
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://acm.hdu.edu ...
【最短路+dijkstra+有难度】杭电 hdu 1245 Saving James Bond
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://acm.hdu. ...
【最短路+dijkstra】 2680 Choose the best route
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://acm.hdu. ...
【最短路+floyd】杭电 hdu 1217 Arbitrage
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://acm.hdu. ...
【最短路+dfs+dijkstra】杭电 hdu 1142 A Walk Through the Forest
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://acm.hdu.edu ...
【最短路+模板题】杭电 hdu 2112 HDU Today
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : http://acm.hdu.edu ...