![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
搜索
ZX_zengxi
哈哈
展开
-
Battle City(POJ - 2312)(深搜+优先队列)
Battle City(POJ - 2312)Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now. What we are discussing is a simple edition of this game. Given a map that consists of empty spaces, rivers,原创 2017-07-22 10:56:30 · 588 阅读 · 0 评论 -
Maze(CodeForces - 377A )(思维,广搜)
Maze(CodeForces - 377A )Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.原创 2017-07-25 14:47:44 · 513 阅读 · 3 评论 -
Fire!( UVA - 11624)
Fire!( UVA - 11624) Joe works in a maze. Unfortunately, portions of the maze havecaught on fire, and the owner of the maze neglected to create a fireescape plan. Help Joe escape the maze.Given Joe’s location in the maze and wh原创 2017-07-28 19:38:13 · 377 阅读 · 0 评论 -
Garland(CodeForces - 767C )
Garland(CodeForces - 767C )Once at New Year Dima had a dream in which he was presented a fairy garland. A garland is a set of lamps, some pairs of which are connected by wires. Dima remembered that each two lamps in the garland were connected directly or原创 2017-07-28 19:50:52 · 632 阅读 · 0 评论 -
非常可乐(HDU-1495)
非常可乐大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,原创 2017-07-28 20:17:53 · 1390 阅读 · 1 评论 -
选择子序列(51nod-1153)
长度为N的整数数组A,所有的数均不相同,假设下标从0开始。找到一个最长的数组B,B数组的长度为K,数值范围是0 - N - 1,记录的是A数组的下标。满足A[B[0]] > A[B[1]] > A[B[2]] >...A[B[K]],并且对任意连续的两项B[i]及B[i + 1],满足min(B[i],B[i + 1]) < j < max(B[i],B[i + 1]) 均有A[j] < A[B[i + 1]] ,求最大的K。例如:9, 10, 2, -1, 3, -5, 0, -3, 1, 12, 5,原创 2017-09-07 16:02:27 · 422 阅读 · 0 评论