Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Memory Limit Exceed!为什么不能用这样用搜索。内存小的人来看一下变量如下 int a[5001][5001];//邻接矩阵 int move[5001][5001];//记录一条边的状态 int n,m; bool visited[5001];//标志数组,深度搜索时用 显然内存超了,但是我再简化,其中int a[5001][5001]和bool visited[5001]这两个数组也不能去掉阿 大家过的人是怎么做的呢? Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator