menguands的专栏

For a set of sequences of integers {a1, a2, a3, ..., an}, we define a sequence {ai1, ai2, ai3, ..., aik} in which 1 ≤ i1 i2 i3 ik ≤ n, as the sub-sequence of {a1, a2, a3, ..., an}. It is quite

#include #include #include #include #include using namespace std; const int N=30010; int n,m,tot,head[N],next[N*2],to[N*2],val[N],pre[N],dep[N],q[N],size[N],son[N],top[N],w[N],id[N]; int MAX[N<<2],sum