HBC233145[JSOI2013]游戏中的学问,动态规划Illuminations II题解 (youaregiventwo)

一个忧伤的美男子 算法基础篇 32 0
挑战自我,勇攀编程高峰!全网最全C++题库,助您成为编程达人。
You are given two convex polygons, where the larger polygon hasnnnvertices and the smaller polygon hasmmmvertices. All the vertices of the smaller polygon locate strictly inside the larger polygon, thus the smaller polygon fully locates strictly inside the larger polygon. Our dear friend JB is going to install an illuminant on the interior boundaries of the larger polygon to light up some exterior boundaries of the smaller polygon. Feeling indecisive, JB decides to choose where to install the illuminant uniformly at random on the interior boundaries of the larger polygon, and you need to calculate the expected length of the illuminated boundaries of the smaller polygon.

You are given two convex polygons, where the larger polygon has nnn vertices and the smaller polygon has mmm vertices. All the vertices of the smaller polygon locate strictly inside the larger polygon, thus the smaller polygon fully locates strictly inside the larger polygon. Our dear friend JB is going to install an illuminant on the interior boundaries of the larger polygon to light up some exterior boundaries of the smaller polygon. Feeling indecisive, JB decides to choose where to install the illuminant uniformly at random on the interior boundaries of the larger polygon, and you need to calculate the expected length of the illuminated boundaries of the smaller polygon.

HBC233145[JSOI2013]游戏中的学问,动态规划Illuminations II题解
(youaregiventwo)-第1张图片-东莞河马信息技术
(图片来源网络,侵删)
成为编程大师,不再是梦想!全网最全C++题库,助您开启编程新篇章。

标签: HBC233145[JSOI2013]游戏中的学问 动态规划Illuminations II题解