codeforces 810C
来源:互联网 发布:编程师 编辑:程序博客网 时间:2024/06/05 23:04
Leha decided to move to a quiet town Vičkopolis, because he was tired by living in Bankopolis. Upon arrival he immediately began to expand his network of hacked computers. During the week Leha managed to get access to n computers throughout the town. Incidentally all the computers, which were hacked by Leha, lie on the same straight line, due to the reason that there is the only one straight street in Vičkopolis.
Let's denote the coordinate system on this street. Besides let's number all the hacked computers with integers from 1 to n. So the i-th hacked computer is located at the point xi. Moreover the coordinates of all computers are distinct.
Leha is determined to have a little rest after a hard week. Therefore he is going to invite his friend Noora to a restaurant. However the girl agrees to go on a date with the only one condition: Leha have to solve a simple task.
Leha should calculate a sum of F(a) for all a, where a is a non-empty subset of the set, that consists of all hacked computers. Formally, let's denote A the set of all integers from 1 to n. Noora asks the hacker to find value of the expression . Here F(a) is calculated as the maximum among the distances between all pairs of computers from the set a. Formally, . Since the required sum can be quite large Noora asks to find it modulo 109 + 7.
Though, Leha is too tired. Consequently he is not able to solve this task. Help the hacker to attend a date.
The first line contains one integer n (1 ≤ n ≤ 3·105) denoting the number of hacked computers.
The second line contains n integers x1, x2, ..., xn (1 ≤ xi ≤ 109) denoting the coordinates of hacked computers. It is guaranteed that all xiare distinct.
Print a single integer — the required sum modulo 109 + 7.
24 7
3
34 3 1
9
There are three non-empty subsets in the first sample test:, and . The first and the second subset increase the sum by 0and the third subset increases the sum by 7 - 4 = 3. In total the answer is 0 + 0 + 3 = 3.
There are seven non-empty subsets in the second sample test. Among them only the following subsets increase the answer: , , , . In total the sum is (4 - 3) + (4 - 1) + (3 - 1) + (4 - 1) = 9.
题意:给定集合,让我们求出所有子集中最大值最小值差的和
思路:很容易我们会想到直接排序,然后暴力枚举a[i]和a[j],那么他们之间的包含i位和j位的子集个数一定是2^(j-i-1)个,ans = 2^(j-i-1)*a[j]-a[i]
但是一定会超时的啊,所以我们考虑
长度为1结果是ans1 = a[1]-a[0]+a[2]-a[1] ....a[n-1]-a[n-2] = (a[1]+a[2]+...+a[n-1] )- (a[0]+a[1]+....+a[n-2])
长度为2是结果是ans2 = a[2]-a[0]+a[3]-a[1]+.....+a[n-1]-a[n-1-2]
这样我们可以清楚的发现ans = ans1+ans2+ans(n-1) = sum[n-1]-sum[i]-sum[n-1-i-1],这里sum[i]代表前i个的和
代码:
#include <iostream>#include <cstdio>#include <string>#include <stack>#include <algorithm>using namespace std;typedef long long ll;const int max_n = 300005;ll mod = 1e9+7;ll a[max_n];ll two[max_n];ll sum[max_n];int n;int main() { scanf("%d",&n); two[0] = 1; for(int i = 0; i < n; i++) { scanf("%lld",&a[i]); if(i > 0) { two[i] = (two[i-1]*2)%mod; } } sort(a,a+n); ll ans = 0; sum[0] = a[0]; for(int i = 1; i < n; i++) { sum[i] = (sum[i-1]+a[i])%mod; } for(int i = 0; i < n-1; ++i) { ll temp = sum[n-1] - sum[i] - sum[n-1-i-1]; temp = (temp+mod)%mod; ans += (two[i]*temp%mod); ans %= mod; } printf("%lld\n",ans); return 0;}
- codeforces 810C
- CodeForces 810C
- codeforces 810 C
- Codeforces-340-C(c++)
- Codeforces-507-C(c++)
- CodeForces 731C C
- CodeForces-612C C
- CODEFORCES 265C CODEFORCES, 265C
- codeforces #78 div2 C
- Codeforces 117C Cycle
- CodeForces 209C
- CodeForces 156C Cipher
- codeforces 148 div2 C
- codeforces 242C
- Codeforces-234C Weather
- codeforces 106C Buns
- codeforces 158C
- Codeforces 243C
- DisplayTag工具类,转自谷歌论坛
- Nio简单介绍,本地操作,通道,缓冲区的简单使用,编码和解码
- 【POJ3090】Visible Lattice Points-欧拉函数应用
- MD5算法原理
- Linux下重修烧录(修改)Mac地址---Eeupdate for Intel
- codeforces 810C
- Ubuntu 16.04下安装最新jdk 1.8
- Android 使用GSM定位
- windows可执行程序的执行过程
- mysql 的 find_in_set函数使用方法
- 149. Max Points on a Line
- Windows下将gvim8配置为Python IDE
- Docker 更新boot2docker.iso
- 安全体系(一)—— DES算法详解