摘要: 1 const int INF = 0x3ffffff;2 //用来存无穷3 4 q.push(x*100+y);5 int tmp=q.front();6 x=tmp/100; y=tmp%100;7 //省地方啊char str[100];memset(str,0,sizeof(str));1 while(!q.empty())q.pop(); 阅读全文
posted @ 2013-12-22 12:18 Yuer~ 阅读(134) 评论(0) 推荐(0) 编辑