2017年07月_xiaoxiede_wo

原创 SPFA-浪里个浪

Time Limit: 1500 mSec Memory Limit : 32768 KB Problem DescriptionTonyY是一个喜欢到处浪的男人，他的梦想是带着兰兰姐姐浪遍天朝的各个角落，不过在此之前，他需要做好规划。现在他的手上有一份天朝地图，上面有n个城市，m条交通路径，每条交通路径都是单行道。他已经预先规划好了一些点作为旅游的起点和终点，他想选择其

2017-07-17 18:01:53 264

原创深搜记录路径——部分和问题

描述给定整数a1、a2、.......an，判断是否可以从中选出若干数，使它们的和恰好为K。输入首先，n和k，n表示数的个数，k表示数的和。接着一行n个数。（1输出如果和恰好可以为k，输出“YES”，并按输入顺序依次输出是由哪几个数的和组成，否则“NO”样例输入4 131 2 4 7样例输出描述给定整数a1、a2、.......an，判断是否可以从中选出若干数，使

2017-07-16 16:51:56 1048

原创广搜记录路径——迷宫问题

定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。 Input 一个5

2017-07-16 16:36:55 320

原创 Salty Fish

海边躺着一排咸鱼，一些有梦想的咸鱼成功翻身（然而没有什么卵用），一些则是继续当咸鱼。一个善良的渔夫想要帮这些咸鱼翻身，但是渔夫比较懒，所以只会从某只咸鱼开始，往一个方向，一只只咸鱼翻过去，翻转若干只后就转身离去，深藏功与名。更准确地说，渔夫会选择一个区间[L,R]，改变区间内所有咸鱼的状态，至少翻转一只咸鱼。渔夫离开后想知道如果他采取最优策略，最多有多少只咸鱼成功翻身，但是咸鱼大概有十万条，所

2017-07-15 08:19:15 1027 1

原创 POJ 1696 Space Ant

凸包问题变化The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye on th

2017-07-12 10:58:52 149

原创 Cows（凸包面积）

Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9628 Accepted: 4221DescriptionYour friend to the south is interested in building fences and turning plowshares into

2017-07-11 14:29:27 201

原创 Wall

HDU 1348Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37308 Accepted: 12710DescriptionOnce upon a time there was a greedy King who ordered his chief Architect

2017-07-10 18:31:12 223

原创 NBUT - 1451 Elise

Eliseis the Spider Queen. She has a skill, Spider Form(蜘蛛形态) . When she transformed to the spider, there will be some small spiders around her.But she has a problem - the small spi

2017-07-10 11:32:40 235

原创 D - Task

HDU - 4864Today the company has m tasks to complete. The ith task need xi minutes to complete. Meanwhile, this task has a difficulty level yi. The machine whose level below this task’s level yi ca

2017-07-08 09:36:45 292

Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after th

2017-07-06 16:44:43 200

原创 Wormholes POJ - 3259

While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that i

2017-07-04 17:27:02 211

原创最短路与最小生成树

最小生成树能够保证整个拓扑图的所有路径之和最小，但不能保证任意两点之间是最短路径。最短路径是从一点出发，到达目的地的路径最小。一句话概括：最小生成树是计算从一节点到另一节点的最小边集；最短路是带权路径，计算权值最小。也就是说，最小生成树要经过每一个点，而最短路只需要能达到某两点，路径权值最小即可！**最短路的算法有Floyd、Dijkstra、Bellman,SPFA 单源就是从...

2017-07-04 17:19:15 1454

原创 Heavy Transportation

Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cu

2017-07-03 11:04:26 168

原创 How Many Answers Are Wrong

TT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should w...

2017-07-01 11:13:48 211

xiaoxiede_wo的博客