A top ten basic questions, and only $ Dybala $, $ Naito $ A no problem and weak than $ yxs $
$T1 Merchant$
Obviously learned the $ nth element $ but because I do not understand the principle of cause Kichiku used a team of $ {U} $ to $ K $ maintenance before the big value
= = Right when reviewed
$ Nth element to ensure that the first $ k $ elements $ accurately after the relative positions of the other elements of the first $ k $ elements accurately.
Note calculate the final answer will be fried $ {long long} $, either midway $ return $, or open float
$T2 Equation$
Open data range of human and animal sound
The result is explosive $ int $ deceptive
You must count limit
$T3 Rectangle$
$ O (n ^ 2) $ approximately rectangular abscissa discussed
Two points on the ordinate abscissa is divided into several blocks
Enumeration on the block boundary is located, single complexity
$ O (k =) Number of two points on the abscissa $
Every enumeration with $ Binary Indexed Tree $ query, a single complexity
$ O (logn) $
Multiply the $ O (n ^ 2 * k * logn) $
$ $ Is the number of n-found abscissa, $ k $ is shared equally abscissa points
Therefore, $ n * k == m $
So seemingly so complexity is $ (nmlogn) $ the O ...