DFS
u010660276
这个作者很懒,什么都没留下…
展开
-
hdoj2660
感觉这道题更像dp,但数据范围小,可以用dfs做# include # include using namespace std;int n,k,m,a[25],b[25],ma,tmp,qian,sum,zl,mark[25];void dfs(int x,int y,int zhi,int w){ int i; if(y==k&&w<=m) { if(zhi>ma)原创 2013-08-01 11:49:22 · 550 阅读 · 0 评论 -
Codeforces Round #261 (Div. 2)(树状数组,dp,dfs构造序列)
C. Pashmak and BusesRecently Pashmak has been employed in a transportation company. The company hask buses and has a contract with a school which hasn students. The school planned to take原创 2014-08-17 10:13:04 · 829 阅读 · 0 评论 -
Trie树(模糊匹配)poj1816
Language:DefaultWild WordsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4681 Accepted: 1221DescriptionA word is a string of lowercases. A word原创 2014-08-15 20:03:24 · 1823 阅读 · 0 评论 -
树的直径 Codeforces Round #260 (Div. 2)E
E. Civilizationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndrew plays a game called "Civilization". Dima helps原创 2014-08-14 20:55:14 · 548 阅读 · 0 评论 -
最小生成树+LCA+uva11354
BNEXT Generation Contest 4Time Limit – 8 secsBond Once again, James Bond is on his way tosaving the world. Bond's latest mission requires him to travel between seve原创 2014-08-13 16:49:07 · 903 阅读 · 0 评论 -
LCA+RMQ+树状数组poj2763
Language:DefaultHousewife WindTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 5754 Accepted: 1442DescriptionAfter their royal wedding, Jiajia an原创 2014-08-10 15:01:43 · 605 阅读 · 0 评论 -
DFS+hdu3720
Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu原创 2014-08-08 18:28:39 · 527 阅读 · 0 评论 -
Codeforces Round #245 (Div. 2)
A. Points and Segments (easy)题意:给定的区间内0,1的个数之差不能超过一思路:原创 2014-05-27 16:45:18 · 500 阅读 · 0 评论 -
五月三号训练赛
A - ODescriptionDr. Fukuoka has placed a simple robot in a two-dimensional maze. It moves within the maze and never goes out of the maze as there is no exit.The maze is made up of H原创 2014-05-03 16:27:15 · 861 阅读 · 0 评论 -
Codeforces Round #264 (Div. 2)(好)
C. Gargari and Bishopstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGargari is jealous that his friend Caisa won t原创 2014-09-03 14:28:42 · 479 阅读 · 0 评论 -
搜索uva1509
题意:第一个穿的没一个字母可以 之多原创 2014-10-31 13:35:43 · 470 阅读 · 0 评论 -
2015 Multi-University Training Contest 5(hdu5343 - 5352)网络流+yy+(哈夫曼树+dp)
MZL’s xorProblem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)(A_i+A_j)(1\leq i,j\leq n) The xor of an array B is defi原创 2015-08-06 12:00:59 · 857 阅读 · 0 评论 -
Codeforces Round #316 (Div. 2)dfs序
B. Simple GameOne day Misha and Andrew were playing a very simple game. First, each player chooses an integer in the range from 1 to n. Let’s assume that Misha chose number m, and Andrew chose number a原创 2015-08-15 22:26:37 · 372 阅读 · 0 评论 -
2012 ACM/ICPC Asia Regional Changchun Online(hdu 4267 - 4277)线段树+dp+dfs+树形dp
A Simple Problem with IntegersProblem Description Let A1, A2, … , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a given number to a few numbers in a原创 2015-08-28 13:20:51 · 519 阅读 · 0 评论 -
2015 Multi-University Training Contest 7(hdu5371、5372、5373、5375、5378、5379)(dp+概率Manachar+dfs计数+树状数组)
Hotaru’s problemProblem DescriptionHotaru Ichijou recently is addicated to math problems. Now she is playing with N-sequence. Let’s define N-sequence, which is composed with three parts and satisfied原创 2015-08-11 23:28:50 · 525 阅读 · 0 评论 -
2015 Multi-University Training Contest 3(hdu 5316、5317、5319、5323、5325、5326)线段树+数学+yy+矩阵快速幂
MagicianProblem DescriptionFantasy magicians usually gain their ability through one of three usual methods: possessing it as an innate talent, gaining it through study and practice, or receiving it fro原创 2015-07-28 18:28:50 · 675 阅读 · 0 评论 -
2014ACM/ICPC亚洲区北京站hdu5112~5122(dp,dfs)
Black And WhiteProblem DescriptionIn mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure原创 2015-05-16 16:08:02 · 1228 阅读 · 0 评论 -
dfs+线段树(hdu5039 - Hilarity)
HilarityTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 461 Accepted Submission(s): 125Problem DescriptionAfter June 1st, elem原创 2015-04-15 22:58:27 · 475 阅读 · 0 评论 -
DFS+uva10317
Problem FEquating EquationsInput: standardinputOutput: standardoutputTime Limit: 6 secondsMemory Limit: 32MB Read equations with up to 16 terms and + and– operators (not unary) and reo转载 2014-11-03 21:19:43 · 408 阅读 · 0 评论 -
SD五一联赛(加权并查集)
ArnyTime Limit: 3000MS Memory limit: 65536K题目描述Bad working coordinator was the everlasting trouble of their spaceship. Arny already had been working under this trouble while his not ve原创 2014-05-01 15:50:32 · 790 阅读 · 0 评论 -
uva10410(dbl)
给出BFS和DFS求树#include#include#include#includeusing namespace std;const int maxn=1010;int n;vector ans[maxn],sub[maxn],pos[maxn];int bfs[maxn],dfs[maxn];void init(){ for(int i=0;i<=n;i++)原创 2014-02-28 23:10:09 · 1056 阅读 · 0 评论 -
hdoj1342
很简单的题,让你在一个集合中,选六个数,要升序,把他们打印出来,这个题唯一要注意的是输出的格式代码如下:#include#include#includeusing namespace std;int a[55],vis[55];int b[55];int n;void dfs(int num){ if(num==6) { cout<<b[0]原创 2013-08-01 17:01:03 · 658 阅读 · 0 评论 -
hdoj1015
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, a原创 2013-07-31 19:27:00 · 1010 阅读 · 0 评论 -
hdoj1627
刚开始思路不清晰,看了人家的解析才明白了。感觉这是道挺不错的题。要注意的是判断是否有相邻的重复串,每次添加完后都要判断,还有就是输出格式。#include #include using namespace std;//递归过程,顺序生成所有的字串。str保存结果,n和L为题目中给出的同名变量void dfs(string &str, int &n, int L) { //记原创 2013-08-01 15:38:45 · 574 阅读 · 0 评论 -
hdoj2266
这种方法的做过好几次,可还是。。。思路:参数是长度,因为前面的已经加起来了,分加减两种情况分别dfs就可以了,其实挺简单,还是自己水平太差。代码如下:#include#include#includeusing namespace std;long n;int cnt;string s;long long he(int i,int j){ long sum=0;原创 2013-08-01 19:42:53 · 615 阅读 · 0 评论 -
dfs小结
这几天做了些dfs的简单题,练习一下dfs的基本用法,hdoj2660,2266,1342,1241,也比较好。稍微总计一下dfs的步骤,基本就是标记当前点,处理当前点,根据范围等判断条件找到当前点的邻接点,调用dfs;还要找好结束条件,进行剪枝,以免时间超时,像1010。再一个,当以后的判断与以前无关时,可用长度做参数,特别是处理字符串的时候像2660,2266等有时候还要注意原原创 2013-08-01 21:04:13 · 541 阅读 · 0 评论 -
poj2255
通过遍历确定二叉树结构的问题题意:给出二叉树的前序遍历和中序遍历,输出二叉树的后序遍历。思路:二叉树前序遍历的首字符是二叉树的根,后序遍历中位于该字符左边的是左子树的中序遍历,右边是右子树的中序遍历。首先找出根节点,然后递归求解左右子树,最后输出根节点字符。代码:#include#includeusing namespace std;string a,b;void tree原创 2013-08-02 09:26:28 · 533 阅读 · 0 评论 -
poj3253
哈夫曼树及二叉堆的应用。思路:计算总花费最小,实际上就是计算带权路径长度和最小的哈夫曼树。以n段目标模板的长度为关键字,构建小根堆。每次分两次取出堆首节点,将其合成一个,插入堆中,答案加上这两次取出的值,知道只剩一个节点。代码:#include#includeusing namespace std;const int maxn=20000+10;long long p[ma原创 2013-08-02 13:05:45 · 518 阅读 · 0 评论 -
hdoj1312
很简单的一道dfs的题,可还是在一些小细节上花了些时间。题意:只能走black,问从起点一共能走多少块black,可以重复走,但不能重复计数。要注意一种情况:2 2@##.刚开始就在这摔了一跤,考虑还是不全面呀。下面是AC代码:#include#include#includeusing namespace std;int w,h;int a[25][25]原创 2013-08-01 10:27:20 · 632 阅读 · 0 评论 -
hdoj1035
这道dfs的题只需要根据具体的方向走就可以,不需要把所有的邻接点都访问一遍。题意:机器人根据网格中的指示,走向不同的方向,如果可以走出去,输出步数;如果走不出去,输出遇到环之前走了几步,并输出环的大小思路:设置一个数组,记录当前走的步数,如果超出范围,说明可以走出去,输出相应的步数;如果遇到被标记的,说明走不出去,先输出当前位置的步数,然后用前一个的步数,减去当前位置的步数,得到环的大小。原创 2013-07-31 17:02:34 · 771 阅读 · 0 评论 -
hdoj1704
题意:每场比赛,告诉你几局结果,问还不知道的结果有多少。思路:建个二维数字存放已知结果,新加入结果时,要检查与原来胜负的关系。代码:#include#include#includeusing namespace std;int match[510][510];int cnt;int t,n,m;void dfs(int x,int y){ for(int i=1原创 2013-08-01 20:45:58 · 561 阅读 · 0 评论 -
Codeforces Round #224 (Div. 2)(数学、dfs)
A.Ksenia and Pan Scales好久没写代码了,写的太烂了。。。#include#include#includeusing namespace std;int Abs(int x){ return x>0?x:(-x);}int main(){ //freopen("in.txt","r",stdin); string a,b;原创 2014-01-29 22:31:59 · 560 阅读 · 0 评论 -
树上最优解+贪心+dfs+LA3902
第一个dfs计算出叶结点的深度,第二个又来标记安放一个服务器后可以覆盖那些节点。下面是代码:#include#include#include#include#includeusing namespace std;const int maxn=1010;int n,s,k,fa[maxn];vector gr[maxn],nodes[maxn];bool cover[max原创 2014-01-02 20:01:03 · 601 阅读 · 0 评论 -
dfs--poj3050
Language:DefaultHopscotchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1505 Accepted: 1074DescriptionThe cows play the child's game of hopscot原创 2013-09-25 21:32:40 · 539 阅读 · 0 评论 -
dfs--poj3187
Language:DefaultBackward Digit SumsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3386 Accepted: 1941DescriptionFJ and his cows enjoy playing a原创 2013-09-22 15:38:51 · 1087 阅读 · 0 评论 -
特殊dfs--poj2718
Language:DefaultSmallest DifferenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2768 Accepted: 792DescriptionGiven a number of distinct decim原创 2013-09-20 21:36:34 · 820 阅读 · 0 评论 -
dfs--poj1979
Language:DefaultEspañolRed and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 19476 Accepted: 10406DescriptionThere is a rectangular room,原创 2013-09-19 20:46:11 · 481 阅读 · 0 评论 -
简单dfs--poj2386
Language:DefaultLake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16414 Accepted: 8323DescriptionDue to recent rains, water has poole原创 2013-09-12 14:57:36 · 633 阅读 · 0 评论 -
dfs数独--poj2676
题意:填补九宫格还是不清晰啊。。。需强化!#include using namespace std;int num,v[100][2],map[10][10];//bool pd[10][10]; //判断输入的时候是否为零bool judge(int x,int y,int k){ int i,j,it,jt; for(i=0;i<9;i++){ if(map[i原创 2013-08-20 22:26:08 · 574 阅读 · 0 评论 -
Codeforces Round #368 (Div. 2)
C - Pythagorean Triples 题意:如何构造勾股数 设 (a,b,c) 是勾股数,当 a 为大于 1 的奇数 2n+1 时, b=2n2+2n,c=2n2+2n+1 ,当 a为大于 4 的偶数 2n 时, b=n2−1,c=n2+1 。D - Persistent Bookcase 将状态作为节点进行dfs,这样对于操作4就可以很方便的进行统计,详细见:Codeforce原创 2016-08-29 15:21:13 · 461 阅读 · 0 评论