HDU 5753 Permutation Bo（多校3 --- 1002）

Permutation Bo

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 339    Accepted Submission(s): 203
Special Judge

Problem Description

There are two sequences  h1∼hn  and  c1∼cn .  h1∼hn  is a permutation of  1∼n . particularly,  h0=hn+1=0 .

We define the expression  [condition]  is 1 when  condition  is True,is 0 when  condition  is False.

Define the function  f(h)=∑ni=1ci[hi>hi−1  and  hi>hi+1]

Bo have gotten the value of  c1∼cn , and he wants to know the expected value of  f(h) .

 

Input

This problem has multi test cases(no more than  12 ).

For each test case, the first line contains a non-negative integer  n(1≤n≤1000) , second line contains  n  non-negative integer  ci(0≤ci≤1000) .

 

Output

For each test cases print a decimal - the expectation of  f(h) .

If the absolute error between your answer and the standard answer is no more than  10−4 , your solution will be accepted.

 

Sample Input

  
  

   
   4
3 2 4 5
5
3 5 99 32 12
  
  

 

Sample Output

  
  

   
   6.000000
52.833333
  
  

  题解：

  代码：

#include <algorithm>
#include <iostream>
#include <numeric>
#include <cstring>
#include <iomanip>
#include <string>
#include <vector>
#include <cstdio>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#define LL long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const LL Max = (1LL<<32) - 1;
const double esp = 1e-6;
const double PI = 3.1415926535898;
const int INF = 0x3f3f3f3f;
using namespace std;

int arr[1005];

int main(){
    int n;
    while(~scanf("%d",&n)){
        LL sum = 0;
        for(int i=2;i<n;i++){
            sum += (i * (i - 1));
        }
        LL ant = n * (n - 1) * (n - 2);
        double ans = 0.0;
        for(int i=0;i<n;i++){
            scanf("%d",&arr[i]);
            if(i == 0 || i == n-1){
                ans += (arr[i] * 1.0 / 2);
            }
            else{
                ans += (arr[i] * sum * 1.0 / ant);
            }
        }
        if(n == 1)
            ans = arr[0];
        printf("%.5f\n",ans);
    }
    return 0;
}