poj 3278 catch that cow
摘要：
bfs，RE多次之后学习大牛的代码，不要惊讶怎么限定在100000范围内！更好的解法：http://www.cnblogs.com/longzhiri/articles/1555344.html 1 # include <stdio.h> 2 # include <string.h> 3 # include <queue> 4 5 using namespace std; 6 7 int n, k, x; 8 int d[100002]; 9 queue<int>Q;10 11 int main()12 { 13 while (~scanf(&q 阅读全文
posted @ 2012-03-29 20:33 getgoing 阅读(173) 评论(0) 推荐(0) 编辑
