问题标题: 酷町堂：3134

题目链接： 酷町堂：3134

#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstring>

#include<iomanip>

#include<algorithm>

#include<sstream>

#include<string>

#include<list>

using namespace std;

int n,a,b,c[10000001],d,t,f[10000011],mi=0x3f3f3f3f;

int main(){

cin>>n>>a>>b>>d;

for(int i=1;i<=d;i++){

cin>>t;

c[t]=1;

}

f[0]=0;

for(int i=1;i<=n+b;i++){

if(c[i]==0){

int ans=0x3f3f3f3f;

for(int j=max(0,i-b);j<=i-a;j++){

ans=min(ans,f[j]);

}

f[i]=ans;

}else{

int ans=0x3f3f3f3f;

for(int j=max(0,i-b);j<=i-a;j++){

ans=min(ans,f[j]);

}

f[i]=ans+1;

}

}

for(int i=n;i<=n+b;i++){

mi=min(mi,f[i]);

}

cout<<mi;

return 0;

}