HBC50895菱形图案Partition problem题解

庄子墨 算法基础篇 33 0
想要检验自己的编程水平?来试试全网最全C++题库,让您在挑战中不断进步。
Given 2N people, you need to assign each of them into either red team or white team such that each team consists of exactly N people and the total competitive value is maximized. Total competitive

Given 2N people, you need to assign each of them into either red team or white team such that each team consists of exactly N people and the total competitive value is maximized. Total competitive value is the summation of competitive value of each pair of people in different team. The equivalent equation is ∑i=12N∑j=i+12N(vij if i-th person is not in the same team as j-th person else 0)sum_{i=1}^{2N} sum_{j=i+1}^{2N} (v_{ij} text{ if i-th person is not in the same team as j-th person else } 0 )∑i=12N​∑j=i+12N​(vij​ if i-th person is not in the same team as j-th person else 0)

HBC50895菱形图案Partition problem题解
-第1张图片-东莞河马信息技术
(图片来源网络,侵删)

标签: HBC50895菱形图案Partition problem题解