Build segment tree for the divisors [ ] array
buildSegtmentTree ( 1 , 1 , maxn - 1 ) ; cout << " Maximum ▁ divisors ▁ that ▁ a ▁ number ▁ has ▁ " << " ▁ in ▁ [ 1 , ▁ 100 ] ▁ are ▁ " << query ( 1 , 1 , maxn - 1 , 1 , 100 ) << endl ; cout << " Maximum ▁ divisors ▁ that ▁ a ▁ number ▁ has " << " ▁ in ▁ [ 10 , ▁ 48 ] ▁ are ▁ " << query ( 1 , 1 , maxn - 1 , 10 , 48 ) << endl ; cout << " Maximum ▁ divisors ▁ that ▁ a ▁ number ▁ has " << " ▁ in ▁ [ 1 , ▁ 10 ] ▁ are ▁ " << query ( 1 , 1 , maxn - 1 , 1 , 10 ) << endl ; return 0 ; }