一开始想先选出送出的物品,再乘以临界点的种类。但是求组合数超时。先枚举临界点,再乘以所有可能(2的幂)即可。
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
using namespace std;
typedef long long LL;
#define INF 100007
#define N 10005
int a[N];
int n;
int m[N];
int main(){
m[0] = 1;
for(int i = 1; i < N; i++){
m[i] = m[i - 1] * 2 % INF;
}
while(scanf("%d", &n) != EOF){
for(int i = 0; i < n; i++){
scanf("%d", &a[i]);
}
sort(a, a + n);
int len = unique (a, a + n) - a;
LL ans = 0;
for(int i = 1; i < len; i++){
int A = (m[i] - 1) % INF;//减去全不选的情况
int B = m[len - i - 1];
ans = (ans + 1LL * A * B % INF) % INF;
}
printf("%lld\n", ans);
}
}