Submission #1750935

---

Source Code Expand

///////////////////////////////////////////////////////////
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<=i##_end_;i++)
#define dwn(i,a,b) for(int i=(a),i##_end_=(b);i>=i##_end_;i--)
using namespace std;
const int Size=1<<16;
char buffer[Size],*head,*tail;
inline char Getchar() {
    if(head==tail) {
        int l=fread(buffer,1,Size,stdin);
        tail=(head=buffer)+l;
    }
    if(head==tail) return -1;
    return *head++;
}
typedef long long ll;
inline ll read() {
    ll x=0,f=1;char c=Getchar();
    for(;!isdigit(c);c=Getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=Getchar()) x=x*10+c-'0';
    return x*f;
}
const int maxn=100010;
const ll inf=1ll<<61;
const int mod=1000000007;
int n;
ll A,B,S[maxn],tmp[maxn];
struct Segment {
	int setv[maxn<<2],sumv[maxn<<2];
	Segment() {memset(setv,0,sizeof(setv));}
	void update(int o,int l,int r,int p,int v) {
		if(l==r) setv[o]=0,(sumv[o]+=v)%=mod;
		else {
			int mid=l+r>>1,lc=o<<1,rc=lc|1;
			if(setv[o]) {
				sumv[lc]=sumv[rc]=0;
				setv[lc]=setv[rc]=1;
				setv[o]=0;
			}
			if(p<=mid) update(lc,l,mid,p,v);
			else update(rc,mid+1,r,p,v);
			sumv[o]=(sumv[lc]+sumv[rc])%mod;
		}
	}
	int query(int o,int l,int r,int ql,int qr) {
		if(setv[o]) return 0;
		if(ql<=l&&r<=qr) return sumv[o];
		int mid=l+r>>1,lc=o<<1,rc=lc|1,res=0;
		if(ql<=mid) (res+=query(lc,l,mid,ql,qr))%=mod;
		if(qr>mid) (res+=query(rc,mid+1,r,ql,qr))%=mod;
		return res;
	}
	void clear() {setv[1]=1;sumv[1]=0;}
}F,G;
int find(ll val) {return upper_bound(tmp+1,tmp+n+2,val)-tmp-2;}
int main() {
	n=read();A=read();B=read();
	S[0]=-inf;rep(i,1,n) S[i]=read();
	rep(i,0,n) tmp[i+1]=S[i];
	F.update(1,0,n,0,1);G.update(1,0,n,0,1);
	rep(i,1,n-1) {
		int v1=F.query(1,0,n,0,find(S[i+1]-B)),v2=G.query(1,0,n,0,find(S[i+1]-A));
		if(S[i+1]-S[i]<A) F.clear();
		if(S[i+1]-S[i]<B) G.clear();
		G.update(1,0,n,i,v1);F.update(1,0,n,i,v2);
	}
	int ans=F.query(1,0,n,0,n-1)+G.query(1,0,n,0,n-1);
	printf("%d\n",ans%mod);
	return 0;
}

Submission Info

Judge Result