2015年08月_hpulw

原创 HDUOJ_2066(floyd)(多起点多终点问题)（虚拟起点，虚拟终点）

HDUOJ_2066(floyd)(多起点多终点问题)（虚拟起点，虚拟终点）一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25489 Accepted Submission(s): 8860Pro

2015-08-28 16:02:33 5907

原创 HDUOJ_2023(求平均成绩)

HDUOJ_(求平均成绩)求平均成绩Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 79521 Accepted Submission(s): 19147Problem Description假设一个班有n(n

2015-08-27 10:56:48 755

原创 HDUOJ_1196(二进制-十进制)

HDUOJ_1196(二进制-十进制)Lowest BitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9713 Accepted Submission(s): 7134Problem Descrip

2015-08-27 00:17:03 505

原创背包问题（课件内容（讲解，容易理解））

背包问题（课件内容（讲解，容易理解））01背包：题目有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。基本思路这是最基础的背包问题，特点是：每种物品仅有一件，可以选择放或不放。用子问题定义状态：即f[i][v]表示前i件物品恰放入一个容量为v的背包可以获得的最大价值。则其状态转移方程便是： f

2015-08-26 20:54:59 889

原创 HDUOJ_2546(饭卡)(背包问题)

HDUOJ_2546(饭卡)(背包问题)饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16658 Accepted Submission(s): 5800Problem Description电子科大本部食堂

2015-08-26 20:02:17 818

原创 HDUOJ_3665(Seaside)(dijkstra)

HDUOJ_3665(Seaside)(dijkstra)SeasideTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1369 Accepted Submission(s): 984Problem Descr

2015-08-24 00:47:39 375

原创 HDUOJ_5137(dijkstra)(How Many Maos Does the Guanxi Worth)

HDUOJ_5137(dijkstra)(How Many Maos Does the Guanxi Worth)How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submissio

2015-08-23 23:09:25 313

原创 POJ_1995(快速幂)（Raising Modulo Numbers）

POJ_1995(快速幂)（Raising Modulo Numbers）Raising Modulo NumbersTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5498 Accepted: 3183DescriptionPeople

2015-08-23 18:27:53 321

原创 POJ_3259(Wormholes)(SPFA判断负权回路)

POJ_3259(Wormholes)(SPFA判断负权回路)Wormholes Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 76 Accepted Submission(s) : 31Problem Descript

2015-08-21 12:09:11 552

原创 HDUOJ_2544(最短路)（SPFA）

HDUOJ_2544(最短路)（SPFA）最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 43105 Accepted Submission(s): 18926Problem Description在每年

2015-08-19 17:39:45 611 1

原创 HDUOJ_1874(畅通工程续)(spfa)

HDUOJ_1874(畅通工程续)(spfa)畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 37072 Accepted Submission(s): 13648Problem Description

2015-08-19 17:33:39 514

原创 dijkstra小结+（虚拟起点、终点简单介绍）

对于dijkstra一类的题要注意以下几点： 1.要注意题目中要求的是不是有向图。有的要求无向图（如：）

2015-08-19 01:49:47 4266

原创 HDUOJ_1596(find the safest road)(dijkstra)

HDUOJ_1596(find the safest road)(dijkstra)find the safest roadTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9272 Accepted Subm

2015-08-19 00:53:30 359

原创 HDUOJ_2680(Choose the best route )(dijkstra)

HDUOJ_(Choose the best route )2680(dijkstra)Choose the best routeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10606 Accepted Submiss

2015-08-18 23:43:58 352

原创 HDUOJ_1869(六度分离)（dijkstra）

HDUOJ_1869(六度分离)（dijkstra）六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5978 Accepted Submission(s): 2414Problem Description

2015-08-18 18:25:19 510

原创 HDUOJ_2112(HDU Today )（dijkstra）

HDUOJ_2112(HDU Today )（dijkstra）HDU TodayTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19684 Accepted Submission(s): 4632Problem D

2015-08-18 17:04:42 316

原创 HDUOJ_2066(一个人的旅行)（dijkstra）

HDUOJ_2066(一个人的旅行)（dijkstra）一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24736 Accepted Submission(s): 8573Problem Descripti

2015-08-18 10:52:57 545

原创 HDUOJ_1874(畅通工程续)（最短路径）（dijkstra）

HDUOJ_1874(畅通工程续)（最短路径）（dijkstra）畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 36877 Accepted Submission(s): 13560Problem D

2015-08-17 21:44:39 536

原创 HDUOJ_2544(最短路)（dijkstra）

HDUOJ_2544(最短路)（dijkstra）最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 42690 Accepted Submission(s): 18702Problem Description在

2015-08-17 17:42:24 459

原创 HDUOJ_1102(Constructing Roads)(最小生成树)

HDUOJ_1102(Constructing Roads)(最小生成树) Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17373 Accepted Submission(s):

2015-08-13 11:11:24 369

原创 POJ_1789(Truck History )(最小生成树（普里姆prim算法）)

POJ_1789(Truck History ) (最小生成树（普里姆prim算法）（从点入手）)（用克鲁斯卡尔算法（从边入手）） Truck History Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 114 A

2015-08-12 22:03:30 762

原创 HDUOJ_1301（最小生成树）

HDUOJ_1301（最小生成树）Jungle RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5488 Accepted Submission(s): 3960Problem Description

2015-08-12 10:55:05 351

原创 HDUOJ_1875（最小生成树）（畅通工程再续）(克鲁斯卡尔和prim两种方法解)

HDUOJ_1875（最小生成树）（畅通工程再续）畅通工程再续Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19805 Accepted Submission(s): 6192Problem Descri

2015-08-12 01:23:13 518

原创 HDUOJ_1233（还是畅通工程）（最小生成树）

HDUOJ_1233（还是畅通工程）（最小生成树）还是畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32652 Accepted Submission(s): 14693Problem Des

2015-08-11 23:50:55 358

原创 HDUOJ-1879（继续畅通工程）（最小生成树）

HDUOJ-1879（继续畅通工程）（最小生成树）继续畅通工程Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17892 Accepted Submission(s): 7711Problem Descri

2015-08-11 23:34:47 364

原创 HDUOJ_1863(畅通工程) （最小生成树）（prim和克鲁斯卡尔两种方法解）

HDUOJ_1863(畅通工程)畅通工程Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21514 Accepted Submission(s): 9274Problem Description省政府“

2015-08-11 23:12:45 383

原创并查集（求树的节点的总个数）

并查集（求树的节点的总个数）题目描述CZY总是遇到这样或那样的问题，现在他又遇到了一个，CZY接到一个大的工程，想想这是走上人生巅峰的第一步啊，CZY想想就高兴，可是这个工程太大了，他需要很多人的帮助才可以，但是为了方便工作，CZY希望他的团队两人两人之间都是朋友关系，或者间接是朋友关系。毕竟是大油水的工程啊，来了一群小伙伴报名，CYZ想请聪明的你帮忙算一算，他可以招到的最大的人数是多

2015-08-11 13:39:01 1208

原创 ZOJ 1671(广度搜索bfs)（Walking Ant）

ZOJ 1671(广度搜索bfs)Walking Ant Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 20 Accepted Submission(s) : 15Problem DescriptionAn

2015-08-07 00:56:34 467

原创 HDUOJ 1789(贪心）

HDUOJ 1789(贪心)Doing Homework againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8869 Accepted Submission(s): 5226Problem Descrip

2015-08-02 18:24:50 386

原创 HDUOJ 1276 (士兵队列训练问题)(这道题有点坑)

HDUOJ 1276 (士兵队列训练问题)(这道题有点坑)士兵队列训练问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4600 Accepted Submission(s): 2144Problem

2015-08-01 23:34:21 3271

hpulw