摘要: 题意: 思路: 实现: 代码: #include <bits/stdc++.h> using namespace std; const int MAXN=300000+2; int n,x,y,k=1; int a[MAXN],head[MAXN],f[MAXN][30],depth[MAXN],c 阅读全文
posted @ 2019-01-26 14:52 jiansong! 阅读(151) 评论(0) 推荐(0) 编辑
摘要: https://www.cnblogs.com/zxqxwnngztxx/p/6814284.html 阅读全文
posted @ 2019-01-26 10:34 jiansong! 阅读(104) 评论(0) 推荐(0) 编辑
摘要: https://www.cnblogs.com/zxqxwnngztxx/p/7672902.html#_label0 读入优化: https://www.cnblogs.com/zxqxwnngztxx/p/7672902.html#_label0 读入优化: inline:加快函数调用 regi 阅读全文
posted @ 2019-01-26 09:31 jiansong! 阅读(189) 评论(0) 推荐(0) 编辑