#include <iostream>
#include <deque>
#include <algorithm>
using std::deque;
using std::cout;
using std::endl;
void print(int elem)
{
cout << elem << ' ';
}
int main()
{
deque<int> dq = { 1, 3, 8, 23, 88, 12, 99, 7 };
deque<int>::const_iterator pos;
pos = find(dq.cbegin(), dq.cend(), 8);
deque<int>::const_reverse_iterator rpos(pos);
cout << *rpos << endl;
}
/*
run:
3
*/