201
edits
Difference between revisions of "BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)"
Jump to navigation
Jump to search
BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) (view source)
Revision as of 21:02, 9 November 2021
, 21:02, 9 November 2021→Replay: add 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)
(→Replay: add 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)) |
(→Replay: add 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)) |
||
| Line 22: | Line 22: | ||
L题上来找规律，找不出来，hr随便手模一下，发现每次只有两种决策，一开始分析错复杂度开始想卡常算法，后来发现复杂度又算错惹 | L题上来找规律，找不出来，hr随便手模一下，发现每次只有两种决策，一开始分析错复杂度开始想卡常算法，后来发现复杂度又算错惹 | ||
== 总结 == | |||
hr开场不要再读骗子题啦啊！ | |||
三个人要会复杂度分析 | |||