- 博客(15)
- 资源 (17)
- 收藏
- 关注
原创 hdu 2660 Accepted Necklace(dfs、dp)
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
2015-01-21 19:30:44 514
原创 hdu 1495 非常可乐 (bfs)
Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S Input三个整数 : S 可乐的体积 ,
2015-01-21 17:56:03 611
原创 hdu 3345 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
2015-01-21 16:34:51 541
原创 hdu 2216 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
2015-01-21 15:25:35 478
原创 hdu 2425 Hiking Trip(bfs)
Problem DescriptionHiking in the mountains is seldom an easy task for most people, as it is extremely easy to get lost during the trip. Recently Green has decided to go on a hiking trip. Unfortuna
2015-01-21 14:25:01 599
原创 hdu 2512 一卡通大冒险(dp)
Problem Description因为长期钻研算法, 无暇顾及个人问题,BUAA ACM/ICPC 训练小组的帅哥们大部分都是单身。某天,他们在机房商量一个绝妙的计划"一卡通大冒险"。这个计划是由wf最先提出来的,计划的内容是,把自己的联系方式写在校园一卡通的背面,然后故意将自己的卡"遗失"在某处(如水房,TD,食堂,主M。。。。)他们希望能有MM看到他们遗失卡,能主动跟他们联系,这样
2015-01-20 18:24:12 713
原创 hdu 1728 逃离迷宫(bfs)
Problem Description 给定一个m × n (m行, n列)的迷宫,迷宫中有两个位置,gloria想从迷宫的一个位置走到另外一个位置,当然迷宫中有些地方是空地,gloria可以穿越,有些地方是障碍,她必须绕行,从迷宫的一个位置,只能走到与它相邻的4个位置中,当然在行走过程中,gloria不能走到迷宫外面去。令人头痛的是,gloria是个没什么方向感的人,因此,她在行走过程
2015-01-13 21:42:36 552
原创 矩阵 快速幂取模算法
快速幂顾名思义,就是快速算某个数的多少次幂。其时间复杂度为 O(log₂N), 与朴素的O(N)相比效率有了极大的提高。以下以求a的b次方来介绍把b转换成二进制。该二进制数第i位的权为例如 11的二进制是101111 = 2³×1 + 2²×0 + 2¹×1 + 2º×1因此,我们将a¹¹转化为算----
2015-01-06 20:58:39 2201
原创 hdu 3714 Error Curves(三分)
Problem DescriptionJosephina is a clever girl and addicted to Machine Learning recently. Shepays much attention to a method called Linear Discriminant Analysis, whichhas many interesting prope
2015-01-06 14:39:48 587
原创 hdu 4707 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
2015-01-06 13:32:31 614
原创 zoj 3203 Light Bulb (三分)
Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious house
2015-01-06 12:57:22 766
原创 uestc 1904 树上的鸟儿
作为电子科大的一员,大家都知道,我们校园有很多高大的银杏树,现在小明正在观察一棵树上的鸟儿,他发现了一些规律。在这个树上,有一些雄鸟和雌鸟(小明很厉害,能分得出鸟儿的雄雌),假如来了一只雄鸟,它会在树上唱歌,如果p分钟内有一只雌鸟飞来和它一起唱,它们就会一直呆在树上不走了,否则p分钟之后,这只雄鸟就会飞走。假如来的是只雌鸟,如果没有落单的雄鸟在树上,它不会落到树上而是直接飞走,否则它会选择等待
2015-01-05 20:34:25 753
原创 hdu 5154 Harry and Magical Computer(拓扑排序,dfs判环)
Problem DescriptionIn reward of being yearly outstanding magic student, Harry gets a magical computer. When the computer begins to deal with a process, it will work until the ending of the processes
2015-01-03 22:13:17 593
原创 图论--关键路径
拓扑排序主要是为解决一个工程能否顺序进行的问题,但有时我们还需要解决工程完成需要的最短时间问题。如果我们要对一个流程图获得最短时间,就必须要分析它们的拓扑关系,并且找到当中最关键的流程,这个流程的时间就是最短时间。在前面讲了AOV网的基础上,来介绍一个新的概念。在一个表示工程的带权有向图中,用顶点表示事件,用有向边表示活动,用边上的权值表示活动的持续时间,这种有向图的边表示活动的网,称之为
2015-01-02 10:09:45 3035
TCP-IP详解卷1:协议
2015-10-15
nasm中文手册
2015-03-12
STL源码剖析简体中文完整版清晰
2014-11-11
C++标准程序库
2014-11-10
ACM培训-动态规划
2014-11-10
取石子游戏_博弈
2014-11-10
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人