摘要：
Catch That Cowhttp://poj.org/problem?id=3278RE了N次，终于过了，数组开小了= =。。顺便联系队列#includestruct point { int pos;}queue[200001];int head=0,tail=0;bool mat[200001]={0};int step[200001];bool is_empty(){ return head==tail; }point dequeue(){ return queue[head++];}void enqueue(point p){ queue[tail++]... 阅读全文
