maze_illusion的博客

int tol,head[maxn]; struct edge { int to,next; }es[maxm]; void addedge( int u , int v ) { es[tol].to = v; es[tol].next = head[u]; head[u] = tol++; } int top[maxn],fa[maxn],dep[maxn],s...

const int maxn = 100010; const int maxm = maxn*30; int n,q,m,tot; int a[maxn],b[maxn]; int T[maxn],lson[maxm],rson[maxm],c[maxm]; int Build( int l , int r ) { int root = tot++; c[root] = 0; ...

int tree[20][maxn],toleft[20][maxn],sorted[maxn]; void Build( int l , int r , int dep ) { if ( l==r ) return; int mid = (l+r)>>1; int lpos = l; int rpos = mid+1; for ( int i...

void Rmq_init( int n , int b[] ) { mm[0] = -1; for ( int i=1 ; i<=n ; i++ ) { mm[i] = ((i&(i-1))==0)?mm[i-1]+1:mm[i-1]; dp[i][0] = b[i]; } for ( int j=1 ; j...

int val[maxn][maxn],dp[maxn][maxn][9][9],mm[maxn]; void Rmq_init( int n , int m ) { mm[0] = -1; for ( int i=1 ; i<maxn ; i++ ) mm[i] = ((i&(i-1))==0)?mm[i-1]+1:mm[i-1]; for...

const int maxn = 60010; const int maxm = maxn*40; int n,q,m,tot; int a[maxn],b[maxn]; int T[maxn],lson[maxm],rson[maxm],c[maxm]; int S[maxn],use[maxn]; int Build( int l , int r ) { int root = tot...

struct Queue { int q[maxn]; int qh,qt; void Init() { memset ( q , 0 , sizeof(q) ); qh = 1; qt = 0; } void Push( int x ) { q[++qt] = x; ...

queue<int>q[maxn]; struct Queue { priority_queue< int,vector<int>,less<int> >A,B; void Push( int x ){A.push(x);} void Pop( int x ){B.push(x);} int Top() { ...

int tol,head[maxn]; struct edge { int to,next; }es[maxm]; void addedge( int u , int v ) { es[tol].to = v; es[tol].next = head[u]; head[u] = tol++; } int top[maxn],fa[maxn],dep[maxn],s...