18寒假第四測

problem 4 full 第一題：裸的樹狀數組 #include <cstdio> const int N = 100010; const int M = N + N; int n, q; int aa[N]; int head[N], dest[M], last[M], etot; int in[N], out[N], seq[N], idc; long long bit[N]; vo

>>阅读原文<<