Difference between revisions of "ACM ICPC Asia Nha Trang 2016 Programming Contest"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "== Problem A == Solved by Weaver_zhu. 00:19:21 (+1) == Problem B == Solved by Weaver_zhu. 01:23:57 (+) == Problem C == Solved by Kilo_5723. 01:28:50 (+5) == Problem D ==...") |
Xiejiadong (talk | contribs) |
||
| Line 42: | Line 42: | ||
Solved by Xiejiadong. 00:15:04 (+1) | Solved by Xiejiadong. 00:15:04 (+1) | ||
| + | |||
| + | 题意：将 $3n$ 个数分成 $n$ 组，每一组的价值是这一组的中位数，求最大的所有组的价值之和。 | ||
| + | |||
| + | 题解：显然，最优配对的方式一定是当前最大的两个搭配当前最小的。 | ||
| + | |||
| + | 也就是价值之和是总的中第 $2$ 大、第 $4$ 大 、 $\cdots$ 、 第 $2n$ 大。 | ||
== Problem L == | == Problem L == | ||
Unsolved. | Unsolved. | ||
Revision as of 10:37, 4 October 2019
Problem A
Solved by Weaver_zhu. 00:19:21 (+1)
Problem B
Solved by Weaver_zhu. 01:23:57 (+)
Problem C
Solved by Kilo_5723. 01:28:50 (+5)
Problem D
Solved by Xiejiadong && Kilo_5723. 04:19:55 (+1)
Problem E
Unsolved.
Problem F
Unsolved.
Problem G
Solved by Xiejiadong. 01:11:16 (+)
Problem H
Unsolved.
Problem I
Solved by Kilo_5723. 04:03:59 (+3)
Problem J
Unsolved.
Problem K
Solved by Xiejiadong. 00:15:04 (+1)
题意：将 $3n$ 个数分成 $n$ 组，每一组的价值是这一组的中位数，求最大的所有组的价值之和。
题解：显然，最优配对的方式一定是当前最大的两个搭配当前最小的。
也就是价值之和是总的中第 $2$ 大、第 $4$ 大 、 $\cdots$ 、 第 $2n$ 大。
Problem L
Unsolved.