小算法:一个排名区间，对应一个奖品，给定一个排名区间，判断它要领取奖品的id

vector<int> m_vRankRegion;
m_vRankRegion.push_back(1);//1 - 1
m_vRankRegion.push_back(1);//2 - 2
m_vRankRegion.push_back(1);//3 - 3
m_vRankRegion.push_back(1);//4 - 4
m_vRankRegion.push_back(1);//5 - 5
m_vRankRegion.push_back(1);//6 - 6
m_vRankRegion.push_back(1);//7 - 7
m_vRankRegion.push_back(1);//8 - 8
m_vRankRegion.push_back(1);//9 - 9
m_vRankRegion.push_back(1);//10 - 10
m_vRankRegion.push_back(5);//11 -15
m_vRankRegion.push_back(5);//16 - 20
m_vRankRegion.push_back(5);//21 - 25
m_vRankRegion.push_back(5);//26 - 30

//输入排名，得到奖品id
int GetIdByRank(int rank)
{
    std::vector<int> :: const_iterator pos;
    int id = 0;
    for(pos = m_vRankRegion.begin(); pos != m_vRankRegion.end(); ++pos)
    {
        if(*pos > 0 && rank >= *pos)
        {
            ++id;
            rank -= *pos;
        }
        else if(*pos > 0 && rank > 0)
        {
            ++id;
            break;
        }
        else
            break;
    }
    return id;
}