MBLHQ的博客

关于dfs的剪枝问题我之前一直是云里雾里的，最后通过做了几道典型的例题，掌握了一些方法，现在将这些题分享给大家。zoj—Exchange Cards Problem DescriptionAs a basketball fan, Mike is also fond of collecting basketball player cards. But as a student, he c

Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23212 Accepted: 9569 Special JudgeDescriptionGiven a positive integer n, write a pr

Hidden StringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1705    Accepted Submission(s): 600Problem DescriptionToday is th

棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31262 Accepted: 15509Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求

速算24点Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1427Description速算24点相信绝大多数人都玩过。就是随机给你四张牌，包括A(1),2,3,4,5,6,7,8,9,10,J(1

BUYING FEED时间限制：3000 ms  |  内存限制：65535 KB难度：4描述Farmer John needs to travel to town to pick up K (1 D*K cents.The county feed lot has N (1 location X_i (0 < X_i John as much as F_i (1 A

24 Point game时间限制：3000 ms  |  内存限制：65535 KB难度：5描述There is a game which is called 24 Point game.In this game , you will be given some numbers. Your task is to find an expressi

最大岛屿时间限制：1000 ms  |  内存限制：65535 KB难度：2描述神秘的海洋，惊险的探险之路，打捞海底宝藏，激烈的海战，海盗劫富等等。加勒比海盗，你知道吧？杰克船长驾驶着自己的的战船黑珍珠1号要征服各个海岛的海盜，最后成为海盗王。  这是一个由海洋、岛屿和海盗组成的危险世界。面对危险重重的海洋与诡谲的对手，如何凭借智慧与运气，建立起一个强大的海盗帝国。杰克船长

走迷宫时间限制：1000 ms  |  内存限制：65535 KB难度：5描述Dr.Kong设计的机器人卡多非常爱玩，它常常偷偷跑出实验室，在某个游乐场玩之不疲。这天卡多又跑出来了，在SJTL游乐场玩个不停，坐完碰碰车，又玩滑滑梯，这时卡多又走入一个迷宫。整个迷宫是用一个N * N的方阵给出，方阵中单元格中填充了一个整数，表示走到这个位置的难度。这个

棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30416 Accepted: 15048Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求

Farm IrrigationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7635    Accepted Submission(s): 3276Problem DescriptionBenny has

递归:递归是指某个函数直接或间接的调用自身。问题的求解过程就是划分成许多相同性质的子问题的求解，而小问题的求解过程可以很容易的求出，这些子问题的解就构成里原问题的解。 例如，二分中常用的寻找根节点的递归：int  find（int x）{return x==per[x]?x:(per[x]=find(per[x]);}hdu--red and black#includec

/*这是学长给我讲的没有条件的全排列,这个模板很适用，在遇到需要根据条件进行排列的题目时，只要将模板稍作改动就行了*/#include #include int n,m,a[10],arr[10]={3,4,5,6},mark[10];void dfs(int v){ if(v >= n){ for(int i = 0;i < n;i++)

基本思想：从初始状态S开始，利用规则生成搜索树下一层任一个结点，检查是否出现目标状态G，若未出现，以此状态利用规则生成再下一层任一个结点，再检查是否为目标节点G，若未出现，继续以上操作过程，一直进行到叶节点（即不能再生成新状态节点），当它仍不是目标状态G时，回溯到上一层结果，取另一可能扩展搜索的分支。生成新状态节点。若仍不是目标状态，就按该分支一直扩展到叶节点，若仍不是目标，采用相同的回溯办法回退

Paths on a GridTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23292 Accepted: 5739DescriptionImagine you are attending your math lesson at school. Once again, you are bored becaus

AntsTime Limit: 2 Seconds      Memory Limit: 65536 KB An army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the

AnagramTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18629 Accepted: 7576DescriptionYou are to write a program that has to generate all possible words from a given set of letters

AnagramTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18629 Accepted: 7576DescriptionYou are to write a program that has to generate all possible words from a given set of letters

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 93682    Accepted Submission(s): 25438Problem DescriptionThe

Siny was once a very happy boy. But one day, something awful happened. He felt so sorrowful and he decided to leave the place where he resided at now. So he packs up his clothes and takes a plane to a