zoukankan      html  css  js  c++  java
  • ZOJ 3932 Deque and Balls

    There are n balls, where the i-th ball is labeled as pi. You are going to put n balls into a deque. In the i-th turn, you need to put the i-th ball to the deque. Each ball will be put to both ends of the deque with equal probability.

    Let the sequence (x1x2, ..., xn) be the labels of the balls in the deque from left to right. The beauty of the deque B(x1x2, ..., xn) is defined as the number of descents in the sequence. For the sequence (x1x2, ..., xn), a descent is a position i (1 ≤ i < n) with xi > xi+1.

    You need to find the expected value of B(x1x2, ..., xn).

    Deque is a double-ended queue for which elements can be added to or removed from either the front (head) or the back (tail).

    Input

    There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

    The first line contains an integer n (2 ≤ n ≤ 100000) -- the number of balls. The second line contains n integers: p1p2, ..., pn (1 ≤ pi ≤ n).

    Output

    For each test case, if the expected value is E, you should output E⋅2n mod (109 + 7).

    Sample Input

    2
    2
    1 2
    3
    2 2 2
    

    Sample Output

    2
    

    0

    第一次遇到求期望的DP题目,每一个数a[i],都可以和前面的数相邻,只要不和自己相同都可以产生新的逆序。所以加上i-1已经

    产生的逆序数*2,再加上新产生的逆序数,要减去和相邻是自己相同的数的排列,用一个数组去维护这个排列数

    #include <iostream>
    #include <string.h>
    #include <algorithm>
    #include <stdlib.h>
    #include <math.h>
    #include <stdio.h>
    
    using namespace std;
    typedef long long LL;
    const LL  mod=1e9+7;
    #define MAX 100000
    LL dp[MAX+5];
    LL p[MAX+5];
    LL num[MAX+5];
    int n;
    int fun()
    {
        p[0]=0;p[1]=1;
        for(int i=2;i<=MAX+5;i++)
        {
            p[i]=(p[i-1]*2)%mod;
        }
    }
    int main()
    {
        int t;
        scanf("%d",&t);
        int a;
        fun();
        while(t--)
        {
            scanf("%d",&n);
            memset(dp,0,sizeof(dp));
            memset(num,0,sizeof(num));
            for(int i=1;i<=n;i++)
            {
                scanf("%d",&a);
                dp[i]=(2*dp[i-1]+p[i-1]-num[a]+mod)%mod;
                if(i==1)
                     num[a]=(num[a]+1)%mod;
                else
                     num[a]=(num[a]+p[i-1])%mod;
    
            }
            dp[n]=(dp[n]*2)%mod;
            printf("%lld
    ",dp[n]);
        }
        return 0;
    }


  • 相关阅读:
    Git SSH Key 生成步骤
    Mac终端(Terminal)自定义颜色,字体,背景
    MAC进入文件夹快捷键
    在Terminal中,如何打开Finder,并显示当前的目录
    mac文件夹怎么重命名?苹果电脑文件夹重命名快捷键
    如何在Mac OS X中开启或关闭显示隐藏文件命令
    怎样将二个路由进行桥接的方法
    关于apache access log 统计的那些事儿
    aaaa
    CodeForces463C Gargari and Bishops(贪心)
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228729.html
Copyright © 2011-2022 走看看