图论
文章平均质量分 80
Hadis_yuki
这个作者很懒,什么都没留下…
展开
-
HDU 1818 It's not a Bug, It's a Feature! (图论SPFA)
It's not a Bug, It's a Feature! Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 138 Accepted Submission(s): 73 Problem Description原创 2013-07-15 10:51:48 · 734 阅读 · 0 评论 -
poj 1789 Truck History (最小生成树)
把每个字符串看成点,i和j的距离就是i串和j串中不同字符的个数。 #include #include #include #define INF 0x3f3f3f3f using namespace std; char str[2010][10]; int dis[2010],edge[2010][2010]; bool vis[2010]; int m,ans; int cmp(原创 2013-10-23 21:55:51 · 716 阅读 · 0 评论 -
ural 1982. Electrification Plan (最小生成树)
#include #include #include #define INF 0x3f3f3f3f using namespace std; int edge[110][110]; int vis[110],dis[110]; bool flag[110]; int n,k,ans; void prim() { int u=1,minw; for(int i=1;i<=n;i+原创 2013-10-21 12:57:22 · 866 阅读 · 0 评论 -
Round #203 (Div. 2)B------Resort
思路:把出度大于1的点去掉,以每一个hotel为起点搜索找最长路径。 链接:点击打开链接 #include #include #include using namespace std; int len,fa[100010],sum[100010],maxpath,hotel[100010]; int dfs(int x) { if(fa[x]==0) r原创 2013-10-02 10:37:01 · 834 阅读 · 0 评论 -
POJ 2485 Highways ( MST 水题 )
题目:点击打开链接 题意:求MST里的最长边。 偶尔刷刷水题,娱乐一下= =! ans作全局变量居然忘了初始化,这可是多组数据啊。。笨蛋。。。 代码: #include #include #include #define INF 0x3f3f3f3f using namespace std; int g[510][510]; int dis[510]; int vis[原创 2013-08-31 20:29:30 · 659 阅读 · 0 评论 -
hdu 4571 Travel in time ( 图论+动态规划 )
Travel in time Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 971 Accepted Submission(s): 196 Problem Description Bob gets tired of pla原创 2013-08-15 09:11:07 · 1163 阅读 · 2 评论 -
HDU 4568 Hunter ( TSP + 状态压缩 )
Hunter Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 529 Accepted Submission(s): 153 Problem Description One day, a hunter named James原创 2013-08-17 22:14:26 · 1323 阅读 · 0 评论 -
hdu 4435 charge-station (贪心+图论)
charge-station Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 587 Accepted Submission(s): 291 Problem Description There are n cities in M原创 2013-08-18 21:47:01 · 1369 阅读 · 3 评论 -
hdu 4081 Qin Shi Huang's National Road System (次小生成树的变形)
题目:Qin Shi Huang's National Road System Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2049 Acc原创 2013-08-28 23:51:37 · 1046 阅读 · 0 评论 -
poj 3229 The Best Travel Design ( 图论+状态压缩 )
The Best Travel Design Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 1359 Accepted: 340 Description Dou Nai is an excellent ACM programmer, and he felt so原创 2013-08-15 23:11:30 · 1256 阅读 · 0 评论 -
HDU 4337 King Arthur's Knights (图论+dfs) = =
King Arthur's Knights Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1518 Accepted Submission(s): 645 Special Judge Problem Description I原创 2013-08-08 12:44:24 · 947 阅读 · 0 评论 -
poj 1659 Frogs' Neighborhood (贪心 + 判断度数序列是否可图)
Frogs' Neighborhood Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 6076 Accepted: 2636 Special Judge Description 未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名原创 2013-08-20 14:36:24 · 1294 阅读 · 0 评论 -
poj 3026 Borg Maze (bfs+prim)
题意:在迷宫中找存在的外星人A撒。。开始是一个组织找,后来这个组织可以分裂成 很多组。求找到所有外星人的最小步数。(分裂后,步数计算为所有组织的步数和) 思路:因为要保证每个外星人A都找到,加上组织所在起始点S,求最小步数。即求图中 n个点的最小生成树(n=外星人的个数+1)。 bfs找每两点间的距离。原创 2013-10-24 06:31:19 · 968 阅读 · 0 评论