Kim0403的博客

这道题麻烦一些。就是一个扫地机器人，遇到障碍会右转，问最多会清扫多少地方。如果它进入一个胡同，会困在那里，所以要判断是不是被困住了。细节见代码。#include#include#include#include#include#include#include#include#include#include#include#include#include#includ

简单的搜索。详见代码。#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define CPY(A, B) memcpy(A, B, siz

POJ 3172 Scales 砝码的特点:f[n]>=f[n-2]+f[n-1],由斐波那契数列知N最多45、46项，题意说The balance has a maximum mass rating and will break if FJ uses more than a certain total mass C (1 如果用背包10^9数组开不出来，而且10^9*45超时

搜索题，简单DFS#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define CPY(A, B) memcpy(A,

增加了方向的搜索#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define CPY(A,B)memcpy(A,B,sizeof

嗯……很多博客都做了详细介绍和解释。http://blog.youkuaiyun.com/freezhanacmore/article/details/8168265等等#include#include#include#include#include#include#include#include#include#include#include#include#incl