摘要: 思路:维护一个森林,二分枚举最小的最大值。#include#include#include#include#include#include#include#include#include#include#include#define pb push_back#define mp make_pair#define Maxn 20010#define Maxm 40010#define LL long long#define Abs(x) ((x)>0?(x):(-x))#define lson(x) (xdfn[u]){ is[u]=1; ... 阅读全文
posted @ 2013-09-30 21:09 fangguo 阅读(166) 评论(0) 推荐(0) 编辑