Difference between revisions of "2016-2017 Codeforces Trainings Season 3 Episode 7(CT S03E07)"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "== Problem A == Unsolved. == Problem B == Solved by Kilo. 00:10(+) == Problem C == Solved by Kilo. 00:50(+) == Problem D == Solved by Weaver_zhu && Kilo. 03:43(+) == P...") |
Xiejiadong (talk | contribs) |
||
| Line 18: | Line 18: | ||
Solved by Xiejiadong. 00:20(+) | Solved by Xiejiadong. 00:20(+) | ||
| + | |||
| + | 题意：给第一匹马找一个匹配，询问是否存在第一匹马的匹配代价大于其他所有的匹配。 | ||
| + | |||
| + | 题解：贪心。显然给第一匹马找最大的匹配。 | ||
| + | |||
| + | 其余的肯定是最大的和最小的匹配，依此类推。 | ||
| + | |||
| + | 直接排序，暴力判断即可。 | ||
== Problem F == | == Problem F == | ||
Revision as of 15:34, 20 February 2019
Problem A
Unsolved.
Problem B
Solved by Kilo. 00:10(+)
Problem C
Solved by Kilo. 00:50(+)
Problem D
Solved by Weaver_zhu && Kilo. 03:43(+)
Problem E
Solved by Xiejiadong. 00:20(+)
题意：给第一匹马找一个匹配，询问是否存在第一匹马的匹配代价大于其他所有的匹配。
题解：贪心。显然给第一匹马找最大的匹配。
其余的肯定是最大的和最小的匹配，依此类推。
直接排序，暴力判断即可。
Problem F
Solved by Xiejiadong. 03:23(+8)
Problem G
Unsolved.
Problem H
Unsolved.
Problem I
Solved by Weaver_zhu. 02:10(+12)
Problem J
Unsolved.
Problem K
Solved by Kilo. 04:44(+)