What is the fastest way to find longest 'consecutive numbers' streak in vector ?
===

I have a sorted `std::vector<int>` and I would like to find the longest 'streak of consecutive numbers' in this vector and then return both the length of it and the smallest number in the streak. 

To visualize it for you : 
suppose we have : 
`1 3 4 5 6 8 9`

I would like it to return: `maxStreakLength = 4` and `streakBase = 3`

There might be occasion where there will be 2 streaks and we have to choose which one is longer. 

What is the best (fastest) way to do this ? I have tried to implement this but I have problems with coping with more than one streak in the vector. Should I use temporary vectors and then compare their lengths?