概率论与数理统计（专属笔记）

X服从参数n、p的二项分布记作 ： X~b(n,p);
泊松定理 ： n*p=\(\lambda\)

\[\lim_{n \to +\infty} {k \choose n}P_0^\infty {k \choose n}(1-p_n)^(n-k) \]

松柏分布 ：\(X\)~\(P\)\((\lambda>0)\)
正态分布 ：\(f(x)=\frac{1}{\sigma\sqrt{2\pi}}e^-\frac{(x-\mu)^2}{2\sigma^2}\)
密度 ： \(f_Y(y)=f_X(h(y)) |h'(y)|\)
\((x^2 + x^y )^{x^y}+ x_1^2= y_1 - y_2^{x_1-y_1^2}\) \((x^2 + x^y )^{x^y}+ x_1^2= y_1 - y_2^{x_1-y_1^2}\)

There are \(n\) nails driven into the wall, the \(i\)-th nail is driven \(a_i\) meters above the ground, one end of the \(b_i\) meters long rope is tied to it. All nails hang at different heights one above the other. One candy is tied to all ropes at once. Candy is tied to end of a rope that is not tied to a nail.

To take the candy, you need to lower it to the ground. To do this, Rudolph can cut some ropes, one at a time. Help Rudolph find the minimum number of ropes that must be cut to get the candy.

The figure shows an example of the first test: