On the basis of the current adaptive constraint solving algorithms, this paper proposed a new adaptive constraint propagation solving algorithm ADAPTAC-LmaxRPC, which adaptively switches between enforcing a strong and expensive local consistency LmaxRPC and a weak but more cheaper one AC according to the activity of individual constraints. Test data from several Benchmark instances shows that ADAPTAC-LmaxRPC balances the contradiction between the constraint solving efficiency and algorithm cost effectively, and it improves the efficiency of constraint solving substantially.