https://cn.vjudge.net/problem/Gym-101291D
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;
int c[maxn+12];
bool vis[maxn+12];
void add(int x,int val)
{
while(x<maxn)
{
c[x]+=val;
x+=lowbit(x);
}
}
int getsum(int x)
{
int ans=0;
while(x>0)
{
ans+=c[x];
x-=lowbit(x);
}
return ans;
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int n,k,r;
scanf("%d%d%d",&n,&k,&r);
for(int i=0;i<k;i++)
{
int x;
sfi(x);
vis[x]=1;
add(x,1);
}
int ans=0;
for(int i=1;i+r-1<=n;i++)
{
int num=getsum(i+r-1)-getsum(i-1);
//cout<<num<<endl;
if(num<2)
{
for(int j=i+r-1;j>=i;j--)
{
if(num>=2) break;
if(!vis[j])
{
vis[j]=1;
num++;
ans++;
add(j,1);
}
}
}
}
printf("%d\n",ans);
return 0;
}