To use the reverse iterator we have to convert it to a straight one, by its base() member function. But you should pay attention to the context in which you are using it.
Here we have a vector and we perform a reverse find() looking for an element:
for(int i = 0; i < 5; ++i)
std::vector<int>::reverse_iterator rit = find(vi.rbegin(), vi.rend(), 3);
To insert a new element in the vector after the found, we pass the converted resulting reverse iterator to the insert() vector member function:
vi.insert(rit.base(), 99);But if we want to erase the element we found we actually need to decrement the converted iterator before removing:
if(rit != vi.rend())
If we forget to do that the unexpected result will be to remove the next element instead (in this case _4_ instead of _3_).
More on this topic in Effective STL Item 28. Have fun with the Effective C++ book series by Scott Meyers.