Subscribed unsubscribe Subscribe Subscribe

0w1

SRM

SRM 687 Hard. Queueing ( Probability DP )

TopCoder Arena TOI 排隊約瑟夫問題 ( DP + 代數分析 ) - 0w1 和這題非常類似。 It is possible to brute force this problem until the EPS is reached, see pekempey.hatenablog.com dp[ i ][ j ] : i people in the first queue, j people in the second …

SRM 687 Med. Quacking ( Greedy + Imosu )

TopCoder Arena Greedily gather each quack from the left as earlier as possible. Suppose a quack found in that way is in some interval [ s, t ], than we are to find the count of the position with maximum quacks lying on. We could simply add…