Codeforces Round #306 (Div. 2) B DFS

链接：戳这里

B. Preparing Olympiad

time limit per test2 seconds

memory limit per test256 megabytes

inputstandard input

outputstandard output

You have n problems. You have estimated the difficulty of the i-th one as integer ci. Now you want to prepare a problemset for a contest, using some of the problems you've made.

A problemset for the contest must consist of at least two problems. You think that the total difficulty of the problems of the contest must be at least l and at most r. Also, you think that the difference between difficulties of the easiest and the hardest of the chosen problems must be at least x.

Find the number of ways to choose a problemset for the contest.

Input
The first line contains four integers n, l, r, x (1 ≤ n ≤ 15, 1 ≤ l ≤ r ≤ 109, 1 ≤ x ≤ 106) — the number of problems you have, the minimum and maximum value of total difficulty of the problemset and the minimum difference in difficulty between the hardest problem in the pack and the easiest one, respectively.

The second line contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 106) — the difficulty of each problem.

Output
Print the number of ways to choose a suitable problemset for the contest.

Examples
input
3 5 6 1
1 2 3
output
2
input
4 40 50 10
10 20 30 25
output
2
input
5 25 35 10
10 10 20 10 20
output
6
Note
In the first example two sets are suitable, one consisting of the second and third problem, another one consisting of all three problems.

In the second example, two sets of problems are suitable — the set of problems with difficulties 10 and 30 as well as the set of problems with difficulties 20 and 30.

In the third example any set consisting of one problem of difficulty 10 and one problem of difficulty 20 is suitable.

题意：

给出n个数，以及L,R,X

从n个数里任意选num个数(num>1)使得选出来的数总和在区间[L,R]内，且最大最小值相差不超过X

思路：

n<=16，暴力DFS每个数选或者不选，剪枝的话就是题目的限制条件

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<iomanip>
#include<cmath>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define maxn 0x3f3f3f3f
#define MAX 1000100
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef unsigned long long ull;
#define INF (1ll<<60)-1
using namespace std;
int n;
ll a[110],L,R,X;
int vis[110];
int ans=0;
void DFS(int pos,ll sum,ll mn,ll mx){
    if(mx>R) return ;
    if(mx-mn>=X && sum>=L && sum<=R) ans++;
    for(int i=pos+1;i<=n;i++){
        if(!vis[i]){
            vis[i]=1;
            DFS(i,sum+a[i],min(mn,a[i]),max(mx,a[i]));
            vis[i]=0;
        }
    }
}
int main(){
    scanf("%d",&n);
    scanf("%I64d%I64d%I64d",&L,&R,&X);
    for(int i=1;i<=n;i++) scanf("%I64d",&a[i]);
    for(int i=1;i<=n;i++){
        vis[i]=1;
        DFS(i,a[i],a[i],a[i]);
        vis[i]=0;
    }
    cout<<ans<<endl;
    return 0;
}