c++

using list

Implement an automatic shifts arrangement system. Problem description: Given m staffs and n days, find an arrangement that can satisfy (1) each staff must take at least k days off; (2) given that each day requires at least a[i](1<=i<=n) staffs for working, the arrangement on each day should have more than a[i] staffs (when possible)