#include #include #include #include #include /* 1. get a list of numbers from the user 2. calculate all possible permutation of those numbers 3. find the adjacent difference among the elements of all those permutations. 4. accumulate the absolute sum of adjacent difference of the permutations 5. Find the maximum of the absolute sum and save all the permutations that produced the maximum. The maximum is the Range Number */ namespace SL { using List = std::vector; using pair = std::pair using RN_List = std::vector; void calculate_range_number(List&); int sum_of_difference(List&); void print_list(List&); bool cmp(pair const& p1, pair const& p2); } void SL::calculate_range_number(SL::List& L) { SL::List Res(L.size()); SL::RN_List rn_perm; int sd = 0; std::cout << "the range number for the list "; print_list(L); //calculate permutations and the //adjacent difference std::sort(L.begin(), L.end()); do { std::adjacent_difference(L.begin(), L.end(), Res.begin()); int sd = SL::sum_of_difference(Res); rn_perm.push_back( std::make_pair(sd, L)); } while(std::next_permutation( L.begin(), L.end())); std::sort(rn_perm.begin(), rn_perm.end(), SL::cmp); auto it = rn_perm.begin(); int Max = it->first; std::cout << " is " << Max << "\n"; std::cout << "for the permutation(s) : " << "\n"; for(; (Max == it->first && it != rn_perm.end()); ++it) { print_list(it->second); std::cout << "\n"; } std::cout << "\n\n"; } int SL::sum_of_difference(SL::List& R) { return std::accumulate(R.begin()+1, R.end(), 0,// initial sum [](int x, int y) { return std::abs(x) + std::abs(y); }); } void SL::print_list(SL::List& L) { std::cout << "["; auto it = L.begin(); for(;it < L.end()-1; ++it) { std::cout << *it << ", "; } std::cout << *it << "]"; } bool SL::cmp(pair const& p1, pair const& p2) { return p1.first > p2.first; } int main () { using namespace SL; List mylist{8,7,1}; calculate_range_number(mylist); mylist = List{1,2,2,2,3}; calculate_range_number(mylist); return 0; }

range_number.cpp