摘要：
题目链接： http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3757#include#include#include#include#include#include#include#include#include#include#include#define MAXN 1050#define PI acos(-1.0)#define REP(i,n) for(int i=0; i>>">>">n>>m) { memset(used,0,sizeof(used) 阅读全文
posted @ 2014-03-17 15:48
等待最好的两个人
阅读(168)
评论(0)
推荐(0)