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) .
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) .
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.
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
根据期望的线性性,我们可以分开考虑每个位置对答案的贡献。
可以发现当i不在两边的时候和两端有六种大小关系,其中有两种是对答案有贡献的。
那么对答案的贡献就是3ci。
在两端的话有两种大小关系,其中有一种对答案有贡献。
那么对答案的贡献就是2ci。
复杂度是O(n)。
注意特判n=1的情况。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
#include<queue>
#define INF 99999999;
using namespace std;
int main(){
int a[1005];
int n;
double num;
while(~scanf("%d",&n)){
num=0.0;
if(n==1){
scanf("%d",&a[0]);
printf("%lf\n",a[0]*1.0);
}
else{
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
if(i==0||i==n-1) num+=a[i]*1.0/2;
else num+=a[i]*1.0/3;
}
printf("%lf\n",num);
}
}
return 0;
}