2020-2021:teams:farmer_john:2016-2017_acm-icpc_neerc_southern_subregional_contest
目录
2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest
A.
solved by 2sozx
题意
题解
B.
solved by 2sozx
题意
给 $n$ 个数，请在比较次数不超过 $\lceil \frac{3 * n}{2} \rceil - 2$ 下找到序列的最大值和最小值。
题解
考虑两两比较出最大值和最小值，按照线段树的方式从子节点向上合并，总共比较次数正好是上限。
C.
upsolved by
题意
题解
D.
upsolved by
题意
题解
E.
upsolved by
题意
题解
F.
upsolved by
题意
题解
G.
upsolved by
题意
题解
H.
upsolved by
题意
题解
I.
upsolved by
题意
题解
J.
upsolved by
题意
题解
记录
0min：分题，CSK冲G
13min：CSK WA，MJX冲A
20min：CSK 找到bug AC,MJX AC，CSK 冲H
34min：CSK WA2，ZYF冲J
36min：ZYF AC，CSK继续冲H
46min：CSK AC，MJX 冲B
51min：MJX挂一次后AC,ZYF 冲I
64min：ZYF AC，MJX 冲C
96min：MJX WA3，ZYF 冲D
119min：ZYF WA，CSK 冲E
138min：CSK AC，ZYF AC，MJX 继续冲C
152min：MJX AC,一起冲K
till end：冲不动了
总结
MJX：求求BFS好好学学吧，太蠢了太蠢了，好几次了
2020-2021/teams/farmer_john/2016-2017_acm-icpc_neerc_southern_subregional_contest.1602293985.txt.gz · 最后更改: 2020/10/10 09:39 由 2sozx
