Submission #2178737

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <stack>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#define mst(a,b) memset(a,b,sizeof(a))

using namespace std;
typedef long long ll;
const double PI=3.14159265;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
const int mod=1e7;
const int M=1e6;

typedef pair<int,int>p;
p a[100005];

int main() {
	int n,t,i,temp=0,d;
	
	scanf("%d %d %d",&n,&t,&d);
	for(i=0;i<n;i++)  scanf("%d",&a[i].first), a[i].second=a[i].first+d;
	
	sort(a,a+n);
	
	a[n].first=inf;
	int left1=a[0].second;
	

	int mm=left1,c=1;
	
	for(i=1;i<=n;i++){
		
		if(a[i].first > left1+1){
			if(mm>left1){
				left1=mm;
				c+=max((temp/t),1);
				temp=0;
			}
		}
		if(a[i].first <= left1+1){
			if(mm < a[i].second) {
				mm=a[i].second;
			}
		}
		temp++;
	//	printf("%d %d\n\n",c,temp);
	}
	

	cout<<c<<endl;
	
	return 0;
}

Submission Info

Judge Result