Optimized search amount of numbers between few maximum nums

unsigned check(int *Items, int Count)
{
    int max = 0, start = 0, end = 0;

    while(Count--)
    {
        if (Items[Count] > max)
        {
            max = Items[Count];
            start = end = Count;
        }
        else if (Items[Count] == max)
        {
            end = Count;
        }
    }

    return start == end ? 0 : (start - end - 1);
}