Disk Storage（微软笔试）

http://hihocoder.com/contest/hiho72/problem/1

#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string.h>

using namespace std;
#define MAXN 100010
int val[MAXN];
int n, m, h, r;
vector< vector<int> > vec;
void solve()
{
    vec.clear();
    for( int i = 0; i < n; i++)
    {
        if(i == 0 || val[i] - val[i-1] > m)
        {
            vector<int> single;
            single.push_back(val[i]);
            vec.push_back(single);
        }
        else
         vec[vec.size() - 1].push_back(val[i]);
    }

    int ans = 0;
    for(int i = 0; i < vec.size(); i++)
    {
        if(vec[i][0] <= r)
        {
            for( int j = 0; j < vec[i].size(); j++)
            {
                if(vec[i][j] <= r + j) ans++;
                else break;
            }


        }
    }
     ans = min(ans, h);
     printf("%d\n", ans);

}
int main()
{

    while(scanf("%d%d%d%d",&n, &m, &h, &r) != EOF){
        for(int i = 0; i < n; i++)
            scanf("%d",&val[i]);
        sort(val, val + n);
        solve();
    }
}