- 博客(4)
- 收藏
- 关注
转载 hiho 1228 : Mission Impossible 6,北京网络赛B题
看了挺久才学会链表的运用,这题用来练list还是挺不错的,模拟题。 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 You must have seen the very famous movie series,"Mission Impossible", from 1 to 4. And "Mission Impossi
2015-09-23 01:49:25 686
原创 hdu5375Gray code (贪心解法
Gray code Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 285 Accepted Submission(s): 156 Problem Description The reflected bina
2015-08-11 22:15:20 505
原创 UVALive 6935 Bricks题解
You are given a sequence of white (W) and black (B) bricks. The goal is to partition it into some number of non-empty, contiguous blocks, each one having the same ratio of white and black bricks. Of
2015-08-10 20:55:57 707
原创 zoj1002题解,递归枚举
zoj1002 题目大意:就是在图上放blockhouse,使得每一行每一列只有一个的基础上加上了墙,有墙'X'的不同侧可以各自放; dfs枚举每一个棋子就ok,我觉得我这份代码还是比较好理解的。 写的时候坑在for了当前行之后没进行下一行dfs。 #include #include #include #include #include #include #include
2015-05-23 20:16:11 897
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人