2016年07月_hncu__lz

原创 hdu 1394 Minimum Inversion Number （线段树）

Problem Description The inversion number of a given number sequence a1, a2, …, an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.For a given sequence of numbers a1, a2, …, an, if we mo

2016-07-30 14:38:54 213

原创 Graph’s Cycle Component （并查集）

Problem Description In graph theory, a cycle graph is an undirected graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain. Now, you are given a

2016-07-29 14:15:09 372

转载 vector用法

转自：http://blog.csdn.net/hancunai0017/article/details/7032383 vector(向量): C++中的一种数据结构,确切的说是一个类.它相当于一个动态的数组,当程序员无法知道自己需要的数组的规模多大时,用其来解决问题可以达到最大节约空间的目的. 用法: 1.文件包含: 首先在程序开头处加上#incl

2016-07-28 11:29:45 221

原创 hdu 1856 More is better （并查集）

Problem Description Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requirements.Mr Wa

2016-07-28 09:46:36 302

原创 hdu 1829 （并查集）

Problem Description Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs

2016-07-27 22:38:46 282

原创 hdu1698 Just a Hook (线段树，区间更新）

Problem Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same

2016-07-26 15:23:15 1891

转载 C++中substr函数的用法

# include < string> # include < iostream> using namespace std; main() { string s(“12345asdf”); string a=s.substr(0,5); //获得字符串s中从第0位开始的长度为5的字符串//默认时的长度为从开始位置到尾 cout << a << endl; }

2016-07-24 19:27:28 267

原创 hdu1175 连连看（BFS+优先队列）

Problem Description “连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来（这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了同学的意见，连线不能从外面绕过去的，但事实上这是错的。现在已经酿成大祸，就只能将错

2016-07-24 11:03:43 306

原创 hdu 统计问题 (递推)

Problem Description 在一无限大的二维平面中，我们做如下假设： 1、每次只能移动一格； 2、不能向后走（假设你的目的地是“向上”，那么你可以向左走，可以向右走，也可以向上走，但是不可以向下走）； 3、走过的格子立即塌陷无法再走第二次；求走n步不同的方案数（2种走法只要有一步不一样，即被认为是不同的方案）。 Input 首先给出一个正整数C，表示有C组测试数据

2016-07-24 09:33:11 3931

原创 hdu 2717 Catch That Cow (BFS)

Problem Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a po

2016-07-23 20:55:28 180

原创 hdu1015 Safecracker （DFS）

Problem Description === Op tech briefing, 2002/11/02 06:42 CST === “The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, al

2016-07-23 20:35:03 234

原创 hdu 变形课（DFS）

Problem Description 呃……变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体. Harry已经将他所会的所有咒语都列成了一个表,他想让你帮忙计算一下他是否能完成老师的作业,将一个B(ball)变成

2016-07-23 18:18:19 386

原创 hduRed and Black （bfs）

Problem Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacen

2016-07-23 18:17:14 167

原创 hdu1885Key Task (BFS+状态压缩）

Problem Description The Czech Technical University is rather old — you already know that it celebrates 300 years of its existence in 2007. Some of the university buildings are old as well. And the nav

2016-07-23 16:32:36 211

原创 hdu3085Nightmare Ⅱ（双向广搜）

Problem Description Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze.

2016-07-23 02:07:29 294

原创 hdu Sum It Up (DFS)

Problem Description Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], th

2016-07-22 21:44:08 249

原创 hdu2612 Find a way（ bfs ）

Problem Description Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze.

2016-07-22 18:17:37 246

原创 hdu A计划 (BFS）

Problem Description 可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚，告招天下勇士来拯救公主。不过公主早已习以为常，她深信智勇的骑士LJ肯定能将她救出。现据密探所报，公主被关在一个两层的迷宫里，迷宫的入口是S（0，0，0），公主的位置

2016-07-22 17:33:15 427

转载康托展开

http://archive.cnblogs.com/a/2026276/转载　　康托展开的公式是 X=an*(n-1)!+an-1*(n-2)!+…+ai*(i-1)!+…+a2*1!+a1*0! 其中，ai为当前未出现的元素中是排在第几个（从0开始）。　　这个公式可能看着让人头大，最好举个例子来说明一下。例如，有一个数组 s = [“A”, “B”, “C”, “D”]，它的一个排列 s

2016-07-22 17:27:24 189

原创 hdu1195

Problem Description Now 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 di

2016-07-21 11:42:43 414

原创 Oil Deposits (dfs)

Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a

2016-07-21 10:45:02 165

原创 Prime Ring Problem （dfs）

Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note

2016-07-21 10:36:20 186

原创 Tempter of the Bone

Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He rea

2016-07-21 10:28:44 195

原创优先队列的使用

队列的特点是先进先出。通常都把队列比喻成排队买东西，大家都很守秩序，先排队的人就先买东西。但是优先队列有所不同，它不遵循先进先出的规则，而是根据队列中元素的优先权，优先权最大的先被取出。通常把优先队列比喻成现实生活中的打印。一个打印店里有很多打印机，每台机器的性能不一样，有的打印机打印很快，有的打印机打印速度很慢。当这些打印机陆陆续续打印完自己的任务时进入排队等候状态。如果我这个时候要打印一份文件，

2016-07-07 11:30:41 353

原创 Prime Ring Problem（DFS）