HBC233770[SCOI2005]互不侵犯KING,状压dp,动态规划Jerome's House题解 (jeromegotseverallargehouse)

柳絮泡泡 算法基础篇 29 0
想要检验自己的编程水平?来试试全网最全C++题库,让您在挑战中不断进步。
) is the value of the first carpet.∣ for these carpets. Jerome is so rich that he wants to maximize his cost. You can just consider this house as a CONVEX polygon.

Jerome just got several large houses as his 18th birthday gifts. To decorate one of these houses, he intends to place several carpets in his house. The house is so large that he can't find a carpet which can cover the whole house. He'll book three identical cycle carpets with the radius rr. He is unwilling to fold his carpet. So the carpets can't exceed the house. If the center coordinates of the three carpets are (x_1,y_1),(x_2,y_2),(x_3,y_3) (x 1 ​ ,y 1 ​ ),(x 2 ​ ,y 2 ​ ),(x 3 ​ ,y 3 ​ ). w_1=x_1(y_2-y_3) w 1 ​ =x 1 ​ (y 2 ​ −y 3 ​ ) is the value of the first carpet. w_2=x_2(y_3-y_1) w 2 ​ =x 2 ​ (y 3 ​ −y 1 ​ ) is the second one's value. And w_3=x_3(y_1-y_2) w 3 ​ =x 3 ​ (y 1 ​ −y 2 ​ ) is the third one's. He will pay |w_1+w_2+w_3| ∣w 1 ​ +w 2 ​ +w 3 ​ ∣ for these carpets. Jerome is so rich that he wants to maximize his cost. You can just consider this house as a CONVEX polygon.

HBC233770[SCOI2005]互不侵犯KING,状压dp,动态规划Jerome's House题解
(jeromegotseverallargehouse)-第1张图片-东莞河马信息技术
(图片来源网络,侵删)
全网最全C++题库,助您挑战自我,突破极限,成为编程领域的佼佼者!

标签: HBC233770[SCOI2005]互不侵犯KING 状压dp 动态规划Jerome's House题解