ACM__搜索
文章平均质量分 85
Element-YoNg
每天晚上疲劳的睡在床上时,才感觉真真切切地过了一天。压力不是有人比你努力,而是比你牛逼几倍的人依然比你努力。即使看不到未来,也依然相信,自己选的人生错不了。第二天叫醒我的不是闹钟,其实,还是梦想。
展开
-
POJ 1088 滑雪
回溯思想。。要记忆化搜索。#include#includeint a[105][105],dp[105][105];int dfs(int x,int y){ if(dp[x][y]>1) return dp[x][y];//如果之前计算过了,直接返回这个计算过的值 int Q,W,E,R,MAX=1; if(a[x][y]>a[x-1][y])原创 2014-03-16 00:38:15 · 503 阅读 · 0 评论 -
HDU 2102 A计划 (深搜)
Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主,因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚,告招天下勇士来拯救公主。不过公主早已习以为常,她深信智勇的骑士LJ肯定能将她救出。现据密探所报,公主被关在一个两层的迷宫里,迷宫的入口是S(0,0,0),公主的位原创 2014-08-02 10:23:57 · 681 阅读 · 0 评论 -
POJ 2251 Dungeon Master
这道题目真心不难,只是最简单的bfs,这个迷宫是放在3维空间里的,走迷宫时只需多加两个方向。思路是找到迷宫入口,开始bfs,找到出口就记录最少步数,没找到就输出Trapped。Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15409 Ac原创 2014-03-23 16:41:06 · 663 阅读 · 0 评论 -
POJ 3009 Curling 2.0
DescriptionOn Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on an ice game board on which a原创 2014-03-29 01:37:41 · 757 阅读 · 0 评论 -
UVa 639 放车问题
刚拿到题目知道要用回溯,可是dfs里传参的思路有问题,卡壳了。。知道这个题目棋盘只有4*4,可以穷举,传递当前车的数量,每一次都与最大值比较。此题得到一个经验,dfs传递的参数可以是结果,根据题目要求在每一次掉用都与当前最值比较,当然,这是在题目数据量不大的情况下。新手做题,逐步积累。。还希望大神指点 。#include#includeint n,vis[10][10],ans;char原创 2014-03-19 11:21:28 · 667 阅读 · 0 评论 -
对BFS与DFS的一些看法 ( 以HDU 1242 Rescue为例 )
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 Ange原创 2014-04-08 12:22:42 · 1646 阅读 · 2 评论 -
POJ 3414 Pots
PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8945 Accepted: 3780 Special JudgeDescriptionYou are given two pots, having the volume of A and B原创 2014-03-23 22:43:38 · 803 阅读 · 0 评论 -
UVa 216 Getting in Line
入门经典里推荐的有关暴力求解的题目,正好新学了STL里有一个算法生成下一个排列。题目里点最多8个,排列量最大8!,只有4万多,暴力求解可行,第一次在UVa上做题,,努力。#include#include #include using namespace std;struct Points{ double x,y,dis;}a[10],res[10];//a用来输入,re原创 2014-03-18 19:08:11 · 492 阅读 · 0 评论 -
poj 3278 Catch That Cow
很简单的广搜,要注意乘2不能越过k的上限,减一不能出现数组下标为负。开始RE了2次,下次会注意。#include#includeint n,k,q[100005],vis[100005],t[100005];int bfs(){ int front=0,rear=0; q[rear++]=n; vis[n]=1; t[n]=0; while(fr原创 2014-03-21 18:36:52 · 443 阅读 · 0 评论 -
poj 1321 棋盘问题
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20705 Accepted: 10272Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编原创 2014-03-23 15:52:21 · 907 阅读 · 0 评论 -
HDU 1016
深度搜索,新手写起来好费劲。#include#includeint k=1,a[25],vis[25];int Is(int x){ int i; for(i=2;i*i<=x;i++) if(x%i==0) return 0; return 1;}void DFS(int index,int n){ int i,j; fo原创 2014-03-10 22:06:02 · 479 阅读 · 0 评论 -
POJ 1426 Find The Multiple
看了输出数据会达到100个数字,想到肯定高精度了,然后就百度了,没想到__int64 就可以水过,果断暴力bfs,直到找到解。Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16582 Accepted: 6758 Special原创 2014-03-23 21:32:27 · 666 阅读 · 0 评论 -
UVa 301 Transportation
Transportation Ruratania is just entering capitalism and is establishing new enterprising activities in many fields including transport. The transportation company TransRu原创 2014-03-19 23:20:01 · 507 阅读 · 0 评论 -
Uva 208 - Firetruck
Firetruck The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given day,原创 2014-03-19 23:27:32 · 555 阅读 · 0 评论 -
Uva 11624 Fire!
Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze.Given Joe's location in the m原创 2014-04-17 11:28:29 · 776 阅读 · 0 评论 -
ZOJ 3420 Double Maze (BFS)
链接 :http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3420普通的BFS 两个图的状态表示成一个状态。记录答案直接用string保存操作。#include #include #include #include #include #include #include #include原创 2015-05-27 21:44:27 · 916 阅读 · 0 评论