[BZOJ3626][LNOI2014][树链剖分][差分][离线处理]LCA
在BZOJ上RE了,求助#include<cstring>#include<cstdio>#include<algorithm>#include<cctype>using namespace std;const int maxn=5e4+5;const int mod=201314;int n,m,cnt,edge,cur,ans[maxn];int to[maxn],nxt[max
原创
2016-11-13 22:10:07 ·
312 阅读 ·
0 评论