Problem 2103 Bin & Jing in wonderland Accept: 221    Submit: 1175Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description Bin ha…

FZU - 2103 Bin & Jing in wonderland 题目大意:有n个礼物,每次得到第i个礼物的概率是p[i],一个人一共得到了k个礼物,然后按编号排序后挑选出r个编号最大的礼物.现在给出r个礼物的编号,问能得到这r个礼物的概率. 首先剩下的k-r个礼物中的编号肯定不能大于r个礼物中最小的编号id,我们就根据id把礼物分成两部分,一部分就是编号大于Id的礼物的,另一部分就是剩下的.对于编号大于id的礼物选取的概率,当前剩余nk1个空位,那么就是挑选num[i]个位置来放它,C[…

Problem 2103 Bin & Jing in wonderland Accept: 201    Submit: 1048 Time Limit: 1000 mSec    Memory Limit : 32768 KB  Problem Description Bin has a dream that he and Jing are both in a wonderland full of beautiful gifts. Bin wants to choose some gifts…

                                                                                                                                     FZOJ Problem 2219 StarCraft                                                                                          …

                                                                                                                                          Problem 2150 Fire Game Accept: 2185    Submit: 7670Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Desc…

                                                                                              Problem 2148 Moon Game Problem Description Fat brother and Maze are playing a kind of special (hentai) game in the clearly blue sky which we can just consid…

                                                                                                                                 Problem 2107 Hua Rong Dao Accept: 401    Submit: 853Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description…

                                                                                                                                                     Problem 2110 Star Accept: 996    Submit: 2958Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem…

题目来源:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=38  Ecological Bin Packing  Background Bin packing, or the placement of objects of certain weights into different bins subject…

Background Bin packing, or the placement of objects of certain weights into different bins subject to certain constraints, is an historically interesting problem. Some bin packing problems are NP-complete but are amenable to dynamic programming solut…