Codeforces Round #320 (Div. 2) 579B. Finding Team Member
来源:互联网 发布:windows装mac双系统 编辑:程序博客网 时间:2024/05/18 21:41
解题报告:Codeforces Round #320
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the values of the strengths are distinct.
Every contestant hopes that he can find a teammate so that their team’s strength is as high as possible. That is, a contestant will form a team with highest strength possible by choosing a teammate from ones who are willing to be a teammate with him/her. More formally, two people A and B may form a team if each of them is the best possible teammate (among the contestants that remain unpaired) for the other one.
Can you determine who will be each person’s teammate?
There are 2n lines in the input.
The first line contains an integer n (1 ≤ n ≤ 400) — the number of teams to be formed.
The i-th line (i > 1) contains i - 1 numbers ai1, ai2, ... , ai(i - 1). Here aij (1 ≤ aij ≤ 106, all aij are distinct) denotes the strength of a team consisting of person i and person j (people are numbered starting from 1.)
Output a line containing 2n numbers. The i-th number should represent the number of teammate of i-th person.
261 23 4 5
2 1 4 3
34870603831 161856845957 794650 97697783847 50566 691206 498447698377 156232 59015 382455 626960
6 5 4 3 2 1
In the first sample, contestant 1 and 2 will be teammates and so do contestant 3 and 4, so the teammate of contestant1, 2, 3, 4 will be 2, 1, 4, 3 respectively.
分析:模拟
第一个数据
6
1 2
3 4 5
转变成
0 6 1 3
6 0 2 4
1 2 0 5
3 4 5 0
Aij表示的是i和j组队的力量值 找最大值是6 A12
所以1选2,2选1
然后不看第一行第一列第二行第二列再找最大值,最大值是5 A34
所以3选4 ,4选3
- Codeforces Round #320 (Div. 2) 579B Finding Team Member
- Codeforces Round #320 (Div. 2) 579B - Finding Team Member
- Codeforces Round #320 (Div. 2) 579B. Finding Team Member
- Codeforces Round #320 (Div. 2)B. Finding Team Member
- Codeforces Round #320 (Div. 2) B - Finding Team Member
- Codeforces Round #320 (Div. 2) B. Finding Team Member
- Codeforces Round #320 (Div. 2) B. Finding Team Member
- Codeforces Round #320 (Div. 2) B. Finding Team Member
- Codeforces Round #320 (Div. 2) 579B Finding Team Member(脑洞)
- Codeforces Round #320 (Div. 2) [Bayan Thanks-Round]B Finding Team Member
- codeforces 578 B. Finding Team Member( Codeforces Round #320 (Div. 2) )
- cf#320 Div.2 Problem B Finding Team Member
- B. Finding Team Member
- 579B(Finding Team Member)
- coderforce 579B. Finding Team Member
- Codeforces Round #356 (Div. 2) B Bear and Finding Criminals
- Finding Team Member
- ★【16.6.2】Codeforces Round #356 (Div. 2) B. Bear and Finding Criminals
- C语言中auto,register,static,const,volatile的区别
- 【转】JSTL 核心标签库 使用
- iOS 本地通知
- 获取目录及子目录下所有文件名
- Privacy Policy
- Codeforces Round #320 (Div. 2) 579B. Finding Team Member
- 欢迎使用CSDN-markdown编辑器
- 实验1正篇——引导PC
- Codeforces Round #320 (Div. 2)578B."Or" Game
- 黑马程序员——JavaSE之学习IO流的心得(一)
- Android 定时器的实现(一)
- Android数据库简单操作之创建数据库
- java 统计数组中各元素出现的次数
- Android 数据传递方式