Difference between revisions of "2019 Multi-University,Nowcoder Day 8"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "== Problem A == Solved by Xiejiadong. 03:52:19 (+1) == Problem B == Solved by Kilo_5723. 00:12:03 (+) == Problem C == Solved by Kilo_5723. 00:38:06 (+1) == Problem D ==...") |
Xiejiadong (talk | contribs) |
||
| Line 26: | Line 26: | ||
Solved by Xiejiadong. 00:18:27 (+1) | Solved by Xiejiadong. 00:18:27 (+1) | ||
| + | |||
| + | 题意：如果有三个连续的字母可以消掉，消掉以后前后相连，问最多能消除几次。 | ||
| + | |||
| + | 题解：如果连续的有一段字母，且个数不是 $3$ 的倍数，无论怎么消，都无法使得这一连续字母前后相连，也就是无论如何都会断掉，所以就可以贪心的消了。 | ||
| + | |||
| + | 用栈维护贪心消除即可。 | ||
| + | |||
| + | 开局智商下线，白送一发。 | ||
== Problem H == | == Problem H == | ||
Revision as of 06:42, 11 August 2019
Problem A
Solved by Xiejiadong. 03:52:19 (+1)
Problem B
Solved by Kilo_5723. 00:12:03 (+)
Problem C
Solved by Kilo_5723. 00:38:06 (+1)
Problem D
Unsolved.
Problem E
Solved by Kilo_5723. 02:44:17 (+)
Problem F
Unsolved.
Problem G
Solved by Xiejiadong. 00:18:27 (+1)
题意：如果有三个连续的字母可以消掉，消掉以后前后相连，问最多能消除几次。
题解：如果连续的有一段字母，且个数不是 $3$ 的倍数，无论怎么消，都无法使得这一连续字母前后相连，也就是无论如何都会断掉，所以就可以贪心的消了。
用栈维护贪心消除即可。
开局智商下线，白送一发。
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Solved by Weaver_zhu. 04:58:42 (+8)