Jone ZP

摘要： void dfs()//参数用来表示状态{ if(到达终点状态) { ...//根据题意来添加 return; } if(越界或者是不符合法状态) return; for(扩展方式) { if(扩展方式所达到... 阅读全文

摘要： N皇后问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12279Accepted Submission(s): 5535Problem Desc... 阅读全文

摘要： 转载：http://blog.csdn.net/zip_fan/article/details/46775633那么接下来就为大家带来线段树的两种基本用法：单点更新和区间更新（又叫成段更新）。 首先线段树它是一棵高度平衡的二叉树，那么很多二叉树的性质它是完美继承的，比如用数组去模拟的话，父节点... 阅读全文

摘要： Buy or BuildTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 1369Accepted: 542DescriptionWorld Wide Networks (WWN) is a leading company that o... 阅读全文

摘要： The SuspectsTime Limit:1000MSMemory Limit:20000KTotal Submissions:17242Accepted:8319DescriptionSevere acute respiratory syndrome (SARS), an atypical p... 阅读全文

摘要： Number of ContainersTime Limit: 1 Second Memory Limit: 32768 KBFor two integers m and k, k is said to be a container ofm if k is divisible by m. Given... 阅读全文

摘要： Description 上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它... 阅读全文

摘要： Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13997Accepted Subm... 阅读全文

摘要： Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black til... 阅读全文

摘要： The 15-puzzle has been around for over 100 years; even if you don’t know it by that name, you’ve seen it. It is constructed with 15 sliding ti... 阅读全文