F-Partition problem_2019⽜客暑期多校训练营(第⼆场)
https://ac.nowcoder.com/acm/contest/882/F 1/1
Partition problem
时间限制:C/C++ 4秒,其他语言8秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld
题目描述
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 max
Total competitive value is the summation of competitive value of each pair of people in different team.
输入描述:
The first line of input contains an integers N.
Following 2N lines each contains 2N space-separated integers vij indicating the competitive value of person i and person j.
1 ≤ N ≤ 14
0 ≤ vij ≤ 10的九次方
vij = vji
输出描述:<