摘要：
F2. Wrong Answer on test 233 (Hard Version) Your program fails again. This time it gets "Wrong answer on test 233" . This is the harder version of the 閱讀全文
posted @ 2019-11-24 23:26
qscqesze
閱讀(691)
評(píng)論(0)
推薦(2)
摘要：
E. Arson In Berland Forest The Berland Forest can be represented as an infinite cell plane. Every cell contains a tree. That is, contained before the 閱讀全文
posted @ 2019-11-24 23:17
qscqesze
閱讀(485)
評(píng)論(0)
推薦(0)
摘要：
D2. Optimal Subsequences (Hard Version) This is the harder version of the problem. In this version, 1≤n,m≤2?105. You can hack this problem if you lock 閱讀全文
posted @ 2019-11-24 23:11
qscqesze
閱讀(373)
評(píng)論(0)
推薦(0)
摘要：
C. Messy You are fed up with your messy room, so you decided to clean it up. Your room is a bracket sequence s=s1s2…sn of length n. Each character of 閱讀全文
posted @ 2019-11-24 23:07
qscqesze
閱讀(418)
評(píng)論(0)
推薦(1)
摘要：
B. Box Permutation p is a sequence of integers p=[p1,p2,…,pn], consisting of n distinct (unique) positive integers between 1 and n, inclusive. For exa 閱讀全文
posted @ 2019-11-24 23:02
qscqesze
閱讀(400)
評(píng)論(0)
推薦(0)
摘要：
A. Math Problem Your math teacher gave you the following problem: There are n segments on the x axis, [l1;r1],[l2;r2],…,[ln;rn]. The segment [l;r] inc 閱讀全文
posted @ 2019-11-24 22:59
qscqesze
閱讀(365)
評(píng)論(0)
推薦(0)
浙公網(wǎng)安備 33010602011771號(hào)