概率DP

DP算法
01
012
0123
01234
012345
…..
01234….60

import java.util.Scanner;

public class Q6A2 {

    public static void main(String[] args) {

        @SuppressWarnings("resource")
        Scanner in = new Scanner(System.in);
        while(true) {

            double[] p = new double[in.nextInt()];
            double[] save = new double[p.length + 1];

            for(int i = 0; i < p.length; i++) {
                p[i] = (double)in.nextInt() / 100;
            }

            int num = p.length - (int)(p.length * 0.4);

            save[0] = 1 - p[0];
            save[1] = p[0];

            for(int i = 1; i < p.length; i++) {

                save[i + 1] = save[i] * p[i];

                for(int j = i; j > 0; j--) {
                    save[j] = save[j] * p[j] + save[j - 1] * (1 - p[j]);
                }

                save[0] = save[0] * (1 - p[i]);

                for(int j = 0; j < save.length && save[j] != 0; j++) {
                }

            }

            double result = 0;

            for(int i = num; i < save.length; i++) {

                result += save[i];

            }

            System.out.println(result);



        }
    }
}