Submission #1439407

---

Source Code Expand

/*
	无记忆化爆搜
	专业爆搜三十年
*/ 
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define pb push_back
#define mp make_pair
#define INF 9999999
#define LINF 9999999999999999
#define SINF "%"
#define uint unsigned int
#define msn(a,v) memset(a,v,sizeof(a))
#define ms(a) msn(a,0)
#define NONE -1
#define ll long long
#define ull unsigned ll
#define uchar unsigned char
#define sint short int
#define usint unsigned sint
#define xsize(a) sizeof(a)/1024/1024
#define fr(aaaaa,bbbbb) for(aaaaa = 1;aaaaa <= bbbbb;aaaaa++)
#define frr(aaaaa,bbbbb,ccccc) for(aaaaa = ccccc;aaaaa <= bbbbb;aaaaa++)
using namespace std;
#define MAXN 100100
#define MOD 1000000007

ll n,a,b;
ll data[MAXN];

//		位置   X中最后一个数 
ll dfs(int pos,ll lastx,ll lasty){
	if(pos == n+1) return 1;
	ll ans = 0;
	if(data[pos] - lastx >= a) ans += dfs(pos+1,data[pos],lasty);
	if(data[pos] - lasty >= b) ans += dfs(pos+1,lastx,data[pos]);
	return ans;
}

int main(){
	//freopen("C.txt","r",stdin);
	
	cin >> n >> a >> b;
	if(a > b) swap(a,b);
	for(int i = 1;i <= n;i++)
		cin >> data[i];
	
	cout << dfs(1,-233,-233) << endl;
	
	return 0;
}

Submission Info

Judge Result