Saving Princess claire 最短路
摘要:
比赛中非常水的一道题,结束时大家才做。。没提交上。。泪奔。。View Code #include<stdio.h>#include<string.h>#include<stdlib.h>#include<iostream>#include<algorithm>#include<map>#include<math.h>#include<queue>using namespace std;int N,M,C,n, maxn;int xx[]={1,0,0,-1};int yy[]={0,1,-1,0}; 阅读全文
posted @ 2012-07-20 22:25 more think, more gains 阅读(160) 评论(0) 推荐(0) 编辑