2017-2018 ACM-ICPC Latin American Regional Programming Contest

Problem A

Solved by kblack. 03:24 (+2)

题意：一堆高度相同（有固定平行边）的凸多边形，要求找到最好的顺序把所有多边形卡在一起最短。

题解：枚举多边形对，从下到上判断边对之间卡在一起的距离，然后状压 DP 求最短的排列，搞一个 (0, 0) 到 (0, H) 的“多边形”后面写起来会方便点。

Problem B

Solved by kblack. 00:54 (+)

Problem C

Solved by zerol. 00:38 (+)

Problem D

Solved by zerol. 02:00 (+)

Problem E

Solved by ultmaster. 01:24 (+)

Problem F

Solved by ultmaster. 00:29 (+1)

Problem G

Solved by zerol. 02:15 (+)

Problem H

Solved by kblack. 00:08 (+)

温暖的签到。

Problem I

Solved by zerol. 01:13 (+)

Problem J

Solved by ultmaster. 00:44 (+)

Problem K

Solved by kblack. 04:23 (+2)

Problem L

Upsolved by zerol. (-1)

Problem M

Solved by ultmaster. 03:47 (+1)