照着以下资料初步学习了树状数组：树状数组题目集.pdf  http://download.youkuaiyun.com/detail/handong1587/5659973http://dongxicheng.org/structure/binary_indexed_tree/http://community.topcoder.com/tc?module=Static&d1=tutorials

http://www.cppblog.com/AClayton/archive/2007/09/17/32367.html

#include #include #include #include #include using namespace std;#if 1#define MAX_X 300#define MAX_Y 300#define INF 0x3f3f3f3fint M;int loc[305][305];int isVis[305][305];

#include #include #include using namespace std;#if 1#define _my_abs_(a) ((a)<0?(-(a)):(a))int t;int d[20];int arr2num(int *a,int len){ int r=0; for (int i=0;i<len;i++) { r=r*10+a[i]; }

poj 1200

本题可用迭代加深搜索的方法求解，

本题是八数码问题可以采用双向广度优先搜索

妈蛋被坑了无数次。。我要怒刷poj