- 博客(22)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 HDU2066：一个人的旅行（Dijkstra）
Problem Description虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自己的阅历，还可以看美丽的风景……草儿想去很多地方，她想要去东京铁塔看夜景，去威尼斯看电影，去阳明山上看海芋，去纽约纯粹看雪景，去巴黎喝咖啡写信，去北京探望孟姜女……眼看寒假就快到了，这么一大
2014-07-31 23:17:05
381
原创 HDU1874：畅通工程续(Dijkstra/Floyd/SPFA)
Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。 Input本题目包含多组数据，请处理到文件结束。
2014-07-31 10:17:27
367
原创 HDU2545:树上战争
Problem Description给一棵树，如果树上的某个节点被某个人占据，则它的所有儿子都被占据，lxh和pfz初始时分别站在两个节点上，谁当前所在的点被另一个人占据，他就输了比赛，问谁能获胜 Input输入包含多组数据每组第一行包含两个数N，M（N，M接下来N-1行，每行2个整数A，B(1接下来M行，每行有2个数，表示lxh和pfz的初始
2014-07-30 21:13:53
505
原创 POJ1182:食物链
Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述： 第一种说法是"1 X Y"，表示X和Y是同类。 第二种说法是"2 X Y"，表示X吃Y。 此人对N个动物
2014-07-30 20:00:05
448
原创 HDU1232:畅通工程
Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？ Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是城镇数目N
2014-07-30 14:03:15
311
原创 POJ1611：The Suspects
DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best s
2014-07-30 11:00:39
297
原创 POJ 2524 Ubiquitous Religions
DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your
2014-07-30 10:14:12
297
原创 HDU1195:Open the Lock(BFS)
Problem DescriptionNow an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. Each time, you can add or minus 1 to any
2014-07-29 17:31:33
282
原创 HDU1548：A strange lift( BFS)
Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When
2014-07-29 16:42:43
302
原创 HDU2181：哈密顿绕行世界问题(DFS)
Problem Description一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m=1.m=0退出. Output输出从第m个城市出发经过每个城市1次
2014-07-29 15:16:11
340
原创 HDU2209:翻纸牌游戏(DFS)
Problem Description有一种纸牌游戏，很有意思，给你N张纸牌，一字排开，纸牌有正反两面，开始的纸牌可能是一种乱的状态（有些朝正，有些朝反），现在你需要整理这些纸牌。但是麻烦的是，每当你翻一张纸牌（由正翻到反，或者有反翻到正）时，他左右两张纸牌（最左边和最右边的纸牌，只会影响附近一张）也必须跟着翻动，现在给你一个乱的状态，问你能否把他们整理好，使得每张纸牌都正面朝上，如果可以
2014-07-27 18:34:01
592
原创 HDU4707:Pet(DFS)
Problem DescriptionOne day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use some cheese to trap the hamste
2014-07-27 16:28:23
412
原创 HDU1238：Substrings(暴力枚举)
Problem DescriptionYou are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of th
2014-07-27 10:59:38
432
原创 POJ2251：Dungeon Master(BFS)
DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one un
2014-07-26 20:52:55
438
原创 POJ3278 Catch That Cow(BFS)
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 46017 Accepted: 14422DescriptionFarmer John has been informed of the location of a fugit
2014-07-26 19:49:53
301
原创 HDU1226:超级密码(BFS)
Problem DescriptionIgnatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0注意:由于宝藏的历史久远,当时的系统最多只能保存500位密码.因此如果得到的密码长度大于500也不能用来开启房门
2014-07-26 09:58:35
369
原创 HDU2660:Accepted Necklace(DFS)
Problem DescriptionI have N precious stones, and plan to use K of them to make a necklace for my mother, but she won't accept a necklace which is too heavy. Given the value and the weight of each
2014-07-25 10:49:39
336
原创 HDU1026：Ignatius and the Princess I(BFS+优先队列)
Problem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrint
2014-07-25 08:44:31
263
原创 HDU3345：War Chess(BFS+优先队列)
Problem DescriptionWar chess is hh's favorite game:In this game, there is an N * M battle map, and every player has his own Moving Val (MV). In each round, every player can move in four directio
2014-07-24 21:01:55
350
原创 HDU1045：Fire Net(DFS)
Problem DescriptionSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A block
2014-07-24 12:48:11
405
原创 HDU1242:Rescue(BFS+优先队列)
Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: approach Angel.
2014-07-23 11:46:09
346
原创 HDU2216:Game III(BFS)
Problem DescriptionZjt and Sara will take part in a game, named Game III. Zjt and Sara will be in a maze, and Zjt must find Sara. There are some strang rules in this maze. If Zjt move a step, Sara
2014-07-23 10:37:50
343
BOX2D 物理游戏编程初学者指南_扫描版
2018-12-19
【数学部分解题集】Introduction to 3D Game Programming with DirectX 11
2015-11-21
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人