zoukankan      html  css  js  c++  java
  • Codeforces 810 C. Do you want a date?

    C. Do you want a date?

    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output
     

    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.

    Input

    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 xi are distinct.

    Output

    Print a single integer — the required sum modulo 109 + 7.

    Examples
    Input
    2
    4 7
    Output
    3
    Input
    3
    4 3 1
    Output
    9
    Note

    There are three non-empty subsets in the first sample test: and . The first and the second subset increase the sum by 0 and 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.

    代码:

    #include<bits/stdc++.h>
    using namespace std;
    const int mod=1e9+7;
    const int N=7*1e6+10;
    typedef long long ll;
    ll a[N],b[N];
    void gg(){
       b[0]=1;
       for(int i=1;i<=N;i++)
       b[i]=(b[i-1]*2)%mod;
    }
    int main(){
        gg();
        int n;
        ll ans;                        
    while(~scanf("%d",&n)){ for(int i=1;i<=n;i++) scanf("%d",&a[i]); sort(a+1,a+1+n); ans=0; for(int i=0;i<=n;i++){ ans=(ans-a[i]*(b[n-i]-1)%mod+mod)%mod; ans=(ans+a[i]*(b[i-1]-1)%mod)%mod; } printf("%lld ",ans); } return 0; }
  • 相关阅读:
    TimesTen的安装和连接
    推荐10款免费而优秀的图表插件
    做了一个jquery插件,使表格的标题列可左右拉伸
    基于SSM实现的简易员工管理系统(基于阿里云的网站上线篇)
    基于SSM实现的简易员工管理系统
    基于局域网的超简易即时通讯软件(二)
    基于局域网的超简易即时通讯软件(一)
    我的Vim常用快捷键
    php最新面试题
    2017php经典面试题
  • 原文地址:https://www.cnblogs.com/ZERO-/p/9692600.html
Copyright © 2011-2022 走看看