Codeforces 235B Let's Play Osu! (概率)

#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <deque>
#include <map>
#include <bitset>
#include <queue>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;

#define LL long long
#define ULL unsigned long long
#define eps 1e-9
#define N 100020
#define M 100010
#define pii pair<int,int>
#define MP make_pair
#define inf 0x3f3f3f3f
#define md (ll+rr>>1)
#define lson ll, md, ls
#define rson md + 1, rr, rs
#define ls (i << 1)
#define rs (ls | 1)
#define mod 1000000007
#define Pi acos(-1.0)

int n;
double p[N], dp[N];


int main() {
	scanf("%d", &n);
	double ans = 0;
	for(int i = 1; i <= n; ++i) {
		scanf("%lf", &p[i]);
		dp[i] = (dp[i-1] + 1) * p[i];
		ans += dp[i] * 2;
		ans -= p[i];
	}
	printf("%.12lf\n", ans);
	return 0;
}