Fork me on GitHub
摘要: luoguvijos两种方法一、带权并查集:问题 front做差#include#include #include#include#include#include#include#includeusing namespace std;int f[50001],front[50000... 阅读全文
posted @ 2017-02-26 11:26 primes 阅读(345) 评论(0) 推荐(0)