2013年08月_Hadis_yuki

原创 POJ 2485 Highways ( MST 水题 )

题目：点击打开链接题意：求MST里的最长边。偶尔刷刷水题，娱乐一下= =！ans作全局变量居然忘了初始化，这可是多组数据啊。。笨蛋。。。代码：#include#include#include#define INF 0x3f3f3f3fusing namespace std;int g[510][510];int dis[510];int vis[

2013-08-31 20:29:30 645

原创 HDU 1498 50 years, 50 colors (行列匹配+最小顶点覆盖）

题目：点击打开链接题意：每个格子有不同颜色的气球用不同数字表示，每次可选某一行或某一列来戳气球。每个人有K次机会。求最后哪些气球不能在 k次机会内被戳破。将这些气球的编号按升序输出。分析：行列匹配，每种颜色的气球都要判断，故dfs传参时加一个气球的编号。感想：1、开始以为要按照最大匹配数按升序排列，昨

2013-08-29 09:55:42 757

原创 hdu 4081 Qin Shi Huang's National Road System (次小生成树的变形)

题目：Qin Shi Huang's National Road SystemQin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2049 Acc

2013-08-28 23:51:37 1029

原创 hdu 1507 Uncle Tom's Inherited Land* 【黑白染色+奇偶匹配(1X2的矩形覆盖)】

题目：Uncle Tom's Inherited Land*题意：有一个矩阵，被分成很多小方格。有些小方格有障碍，问最多能在矩阵中放多少1*2的矩形。分析：黑白染色+奇偶匹配。把格子染成国际象棋棋盘那种黑白相间。这样就能再矩阵中找出两个不相交的点集进行二分匹配。把坐标(i,j）按照（i+j)的奇偶分类。每个

2013-08-28 20:30:58 1007

原创 hdu 4616 Game ( 经典树形dp )

GameTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1436 Accepted Submission(s): 452Problem Description　　Nowadays, there are more and m

2013-08-27 22:51:19 1205 1

原创 hdu 1281 棋盘游戏 ( 行列匹配+求关键点 )

题目：棋盘游戏题意：某些格子若不放子，就无法保证放尽量多的“车”，这样的格子被称做重要点。求重要点的个数。分析：先求最大匹配，然后拆边，看最大匹配数变不变，变则cnt++,最后cnt数就是重要点的个数。代码：#include#include#includeusing namespace std;int g[110][

2013-08-27 19:10:13 964

原创 hdu 1179 Ollivanders: Makers of Fine Wands since 382 BC. (最大匹配)

题目：Ollivanders: Makers of Fine Wands since 382 BC.题意：匹配魔法师和魔杖。分析：二分图最大匹配。代码：#include#include#includeusing namespace std;int match[110];int g[110][110];int vis[110];int n,m;bool dfs(i

2013-08-27 18:04:16 751

原创 hdu 1151 Air Raid ( 最小路径覆盖 )

题目：Air Raid题意：一个城镇，所有街道都是单行的且不成环，每个街道与两个路口相连。求最小数量的伞兵，使他们可以访问所有的路口。伞兵的降落位置不限。分析：实质就是求DAG（有向无环图）上最小路径覆盖。拆点法建二分图：把所有节点拆成两个，X点集中的i和Y点集中的i'。如果有边i--->j,则在二分图

2013-08-27 17:38:22 932

原创 hdu 1150 Machine Schedule ( 最小点覆盖 )

题目：Machine Schedule题意：有A、B两种机器，A机器有n(0~n-1)种模式,B机器有m种（0~m-1)模式。有k项工作可以由A或者B机器中的某种模式完成。当前A、B机器都处于0模式。每次机器换模式都要重启。问用两种机器完成K项工作所需的最小重启数。分析：最小点覆盖=最大匹配数。对于每

2013-08-26 19:23:14 726

原创 HDU 1068 Girls and Boys (二分图匹配---最大独立集)

题目：Girls and Boys题意：有N个学生，已知每个学生与其他人的romantic关系，问有多少人没这个关系。注：只有男生和女生可能有romantic关系。分析：男生和女生分别为两个点集。此题实质为求最大独立集。最大独立集=顶点数-最大匹配数。(此题由于给出的是每个学生的romantic关系，所以最大匹

2013-08-26 17:01:39 979

原创 hdu 4619 Warm up 2 ( 二分图最大匹配 )

题目：Warm up 2题意：有横竖两种方式放着的多米诺骨牌，相同方向的不可能重叠，但是横放和竖放的牌可能重叠。移走重叠的牌使剩下的牌最多。分析：二分图匹配：最大独立点=顶点数-最大匹配数横放的为一个点集，竖放的为一个点集。代码：

2013-08-26 14:21:44 812

原创 POJ 1330 Nearest Common Ancestors (LCA)

Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14836 Accepted: 7923DescriptionA rooted tree is a well-known data structure in com

2013-08-23 16:35:44 611

原创 poj 3264 Balanced Lineup (简单 RMQ )

Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 29174 Accepted: 13743Case Time Limit: 2000MSDescriptionFor the daily milking, Farme

2013-08-23 16:31:09 595

原创 hdu 4424 & zoj 3659 Conquer a New Region (并查集 + 贪心)

Conquer a New RegionTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 657 Accepted Submission(s): 179Problem DescriptionThe wheel of the

2013-08-22 13:34:23 1112 3

原创 poj 1659 Frogs' Neighborhood (贪心 + 判断度数序列是否可图)

Frogs' NeighborhoodTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 6076 Accepted: 2636 Special JudgeDescription未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名

2013-08-20 14:36:24 1281

原创 poj 1017 Packets ( 贪心 )

PacketsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 40110 Accepted: 13424DescriptionA factory produces products packed in square packets of the same he

2013-08-20 08:52:24 665

原创 hdu 4489 The King’s Ups and Downs ( 递推 + 排列组合 )

The King’s Ups and DownsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 184 Accepted Submission(s): 116Problem DescriptionThe king has

2013-08-19 21:22:37 1796

原创 hdu 1087 Super Jumping! Jumping! Jumping! ( 求序列的最大上升序列 )

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17746 Accepted Submission(s): 7617Problem DescriptionNo

2013-08-19 14:15:05 677

原创 hdu 1081 To The Max ( 最大子矩阵 )

To The MaxTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6612 Accepted Submission(s): 3159Problem DescriptionGiven a two-dimensional a

2013-08-19 10:16:33 905

原创 hdu 4435 charge-station 　(贪心＋图论）

charge-stationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 587 Accepted Submission(s): 291Problem DescriptionThere are n cities in M

2013-08-18 21:47:01 1354 3

原创 POJ 1159 Palindrome (动态规划）

PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 48269 Accepted: 16570DescriptionA palindrome is a symmetrical string, that is, a string read ide

2013-08-18 08:47:06 1355

原创 HDU 4568 Hunter ( TSP + 状态压缩 )

HunterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 529 Accepted Submission(s): 153Problem Description　　One day, a hunter named James

2013-08-17 22:14:26 1310

原创 poj 1163 The Triangle (动态规划入门题)

The TriangleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33836 Accepted: 20105Description73 88 1 02 7 4 44 5 2 6 5(Figure

2013-08-17 13:25:33 793

原创 poj 3229 The Best Travel Design ( 图论+状态压缩 )

The Best Travel DesignTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1359 Accepted: 340DescriptionDou Nai is an excellent ACM programmer, and he felt so

2013-08-15 23:11:30 1241

原创 hdu 4571 Travel in time ( 图论+动态规划 )

Travel in timeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 971 Accepted Submission(s): 196Problem Description　　Bob gets tired of pla

2013-08-15 09:11:07 1151 2

原创 hdu 2955 Robberies (0 1背包)

RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8096 Accepted Submission(s): 3063Problem DescriptionThe aspiring Roy the Robbe

2013-08-13 14:48:40 717

原创 hdu 4490 Mad Veterinarian ( BFS+链表记录路径 )

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4490Mad VeterinarianTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 279 Accepted Submiss

2013-08-12 23:27:24 985

原创 POJ 3349 Snowflake Snow Snowflakes (hash 查找)

Snowflake Snow SnowflakesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 27156 Accepted: 7156DescriptionYou may have heard that no two snowflakes are al

2013-08-09 13:51:28 992

转载查找算法----Hash表

查找算法----Hash表散列方法不同于顺序查找、二分查找、二叉排序树及B-树上的查找。它不以关键字的比较为基本操作，采用直接寻址技术。在理想情况下，无须任何比较就可以找到待查关键字，查找的期望时间为O(1)。散列表的概念1、散列表　设所有可能出现的关键字集合记为U(简称全集)。实际发生(即实际存储)的关键字集合记为K（|K|比|U|小得多）。　

2013-08-09 11:24:26 2020

原创 POJ 1573 Robot Motion (模拟+不回溯的dfs 水题)

Robot MotionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9159 Accepted: 4441DescriptionA robot has been programmed to follow the instructions in

2013-08-08 22:59:50 1012

原创 poj 1936 All in All (字符串处理)

All in AllTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 25558 Accepted: 10280DescriptionYou have devised a new encryption technique which encodes a mess

2013-08-08 21:34:01 951

原创 POJ 3080 Blue Jeans (求最长公共字符串）

Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9973 Accepted: 4210DescriptionThe Genographic Project is a research partnership between IBM and

2013-08-08 15:33:21 961

原创 HDU 4337 King Arthur's Knights (图论+dfs) = =

King Arthur's KnightsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1518 Accepted Submission(s): 645Special JudgeProblem DescriptionI

2013-08-08 12:44:24 936

原创 hdu 4334 Trouble (分治缩小复杂度)

TroubleTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3773 Accepted Submission(s): 1182Problem DescriptionHassan is in trouble. His m

2013-08-07 19:02:24 1281

原创 POJ 2632 Crashing Robots (坑爹的模拟题）

Crashing RobotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6599 Accepted: 2854DescriptionIn a modernized warehouse, robots are used to fetch the goods

2013-08-06 23:32:07 1212

原创 poj 1035 Spell checker ( 字符串处理 )

Spell checkerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16675 Accepted: 6087DescriptionYou, as a member of a development team for a new spell checkin

2013-08-06 21:40:31 809

原创 poj 2586 Y2K Accounting Bug (贪心)

Y2K Accounting BugTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8678 Accepted: 4288DescriptionAccounting for Computer Machinists (ACM) has sufferred fro

2013-08-05 22:30:23 915

原创 poj 1068 Parencodings (模拟)

ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17169 Accepted: 10296DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S

2013-08-05 16:38:29 640

原创 poj 2109 Power of Cryptography(用double避开高精度)

Power of CryptographyTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16238 Accepted: 8195DescriptionCurrent work in cryptography involves (among other thi

2013-08-05 11:38:52 897

原创 hdu 4452 Running Rabbits (模拟—12年金华赛区现场赛K题)

Running RabbitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 607 Accepted Submission(s): 432Problem DescriptionRabbit Tom and r

2013-08-05 10:36:14 1110

空空如也

空空如也