HDU 4351 Digital root 线段树区间合并

依然不是十分理解……待考虑……

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <algorithm>

 #define lson l, m, rt << 1
 #define rson m + 1, r, rt << 1 | 1

 using namespace std;

 const int MAXN = ;

 struct node
 {
     int num;
     int lnode, rnode;
     int root;
     node(): num(), lnode(), rnode(), root(){ }
 };

 int root[ MAXN <<  ];
 int num[ MAXN <<  ];
 int lnode[ MAXN <<  ];
 int rnode[ MAXN <<  ];
 int all[  <<  ][  <<  ];

 int GetRoot( int a )
 {
     if ( !a ) return ;
     if ( a %  ) return a % ;
     return ;
 }

 void init()
 {
     for ( int i = ; i < (  <<  ); ++i )
         for ( int j = ; j < (  <<  ); ++j )
         {
             all[i][j] = ;
             for ( int x = ; x < ; ++x )
                 if ( i & (  << x ) )
                 {
                     for ( int y = ; y < ; ++y )
                         if ( j & (  << y ) )
                             all[i][j] |= (  << GetRoot( x + y ) );
                 }
         }
     return;
 }

 void PushUp( int rt )
 {
     int lc = rt << ;
     int rc = rt <<  | ;
     root[rt] = root[lc] | root[rc] | all[ rnode[lc] ][ lnode[rc] ];
     num[rt] = all[ num[lc] ][ num[rc] ];
     lnode[rt] = lnode[lc] | all[ num[lc] ][ lnode[rc] ];
     rnode[rt] = rnode[rc] | all[ num[rc] ][ rnode[lc] ];
     return;
 }

 void build( int l, int r, int rt )
 {
     if ( l == r )
     {
         int a;
         scanf( "%d", &a );
         a = GetRoot(a);
         lnode[rt] = rnode[rt] = num[rt] = root[rt] = (  << a );
         return;
     }

     int m = ( l + r ) >> ;
     build( lson );
     build( rson );
     PushUp( rt );
     return;
 }

 node Query( int L, int R, int l, int r, int rt )
 {
     if ( L <= l && r <= R )
     {
         node D;
         D.root = root[rt];
         D.lnode = lnode[rt];
         D.rnode = rnode[rt];
         D.num = num[rt];
         return D;
     }

     int m = ( l + r ) >> ;

     if ( R <= m ) return Query( L, R, lson );
     else if ( L > m ) return Query( L, R, rson );
     else
     {
         node LD, RD, D;
         LD = Query( L, R, lson );
         RD = Query( L, R, rson );
         D.root = LD.root | RD.root | all[ LD.rnode ][ RD.lnode ];
         D.num = all[ LD.num ][ RD.num ];
         D.lnode = LD.lnode | all[ LD.num ][ RD.lnode ];
         D.rnode = RD.rnode | all[ RD.num ][ LD.rnode ];
         return D;
     }
 }

 int main()
 {
     init();
     int T, cas = ;
     scanf( "%d", &T );
     while ( T-- )
     {
         int n;
         scanf( "%d", &n );
         build( , n,  );

         int Q;
         scanf( "%d", &Q );
         printf( "Case #%d:\n", ++cas );
         while ( Q-- )
         {
             int a, b;
             scanf( "%d%d", &a, &b );
             node ans = Query( a, b, , n,  );

             int cnt = ;
             bool first = false;
             for ( int i = ; i >=  && cnt < ; --i )
                 if ( ans.root & (  << i ) )
                 {
                     if ( first ) putchar(' ');
                     printf( "%d", i );
                     first = true;
                     ++cnt;
                 }
             for ( ; cnt < ; ++cnt ) printf(" -1");
             puts("");
         }

         if ( T ) puts("");
     }
     return ;
 }