题目链接:
题目大意:
给出一堆数,选一些,组成一个集合,满足集合的和在l到r之间,集合的最大值与最小值之差大于x,集合的元素大于2;
题目分析:
数据量小的过分,因为每件物品的状态只有两个,那么直接有一个数位表示这件物品买没买,然后直接枚举,复杂度很低(2^15)*15
两分钟读题,7分钟交题ac
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
int a[17];
int n,l,r,x;
int main ( )
{
while ( ~scanf ( "%d%d%d%d" , &n , &l , &r , &x ) )
{
for ( int i = 0 ; i < n ; i++ )
scanf( "%d" , &a[i] );
int total = 1<<n;
int ans = 0;
//cout << total << endl;
for ( int i = 1 ; i < total ; i++ )
{
int num = 0 , sum = 0 , maxn = 0 , minn = 1000007;
for ( int j = 0 ; j < n ; j++ )
if ( i&(1<<j) )
{
num++;
sum += a[j];
maxn = max ( maxn , a[j] );
minn = min ( minn , a[j] );
}
// cout << "YES : " << num << " " << sum << " ";
// cout << maxn << " " << minn << endl;
if ( num < 2 ) continue;
if ( sum > r || sum < l ) continue;
if ( maxn - minn < x ) continue;
ans++;
}
printf ( "%d\n" , ans );
}
}