Question

How to find the distance between min and max elements in deque using C++

Answer 1

#include <iostream>
#include <deque>
#include <algorithm>

using std::deque;
using std::cout;
using std::endl;

int main()
{
	deque<int> dq = { 3, 6, 9, 7, 1, 2 };

	auto minmax = minmax_element(dq.cbegin(), dq.cend());

	cout << "min: " << *(minmax.first) << endl;    
	cout << "max: " << *(minmax.second) << endl;   

	cout << "distance: " << distance(minmax.first, minmax.second) << endl;

	return 0;
}


/*
run:

min: 1
max: 9
distance: -2

*/

 

70+ SQL courses for beginners and professionals