【Atcoder DP I Coins】

Atc I
题意 给你n个硬币 每个硬币都有一个翻正面的概率
问你n个硬币 正面次数比反面次数多的概率有多少
因为有2999个硬币 最多有2999个 正/反面 那么我们加个校正值
然后让dp[i][j]的意思代表到第 i 个硬币 正硬币次数 - 反硬币次数 + 校正值的几率是多大
那么 dp[i][j] += dp[i-1][j-1](arr[i]),dp[i][j] += dp[i-1][j+1](1-arr[i])

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)