Difference between revisions of "2019 Multi-University,Nowcoder Day 7"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
Xiejiadong (talk | contribs) |
||
| Line 2: | Line 2: | ||
Solved by Xiejiadong. 00:32:38 (+) | Solved by Xiejiadong. 00:32:38 (+) | ||
| + | |||
| + | 题意：将字符串尽可能少的断开，使得断开的每部分都是其循环串种字典序最小的。 | ||
| + | |||
| + | 题解：考虑最多的断开情况，一定是 $1111\; 0111\; 0011\; 0001\; 0000$ 如此的。 | ||
| + | |||
| + | 也就是断开的一定是 $\sqrt{n}$ 级别的。 | ||
| + | |||
| + | 于是考虑贪心的做，从后往前枚举断点，用最小表示法判断合法性即可。 | ||
== Problem B == | == Problem B == | ||
Revision as of 11:03, 8 August 2019
Problem A
Solved by Xiejiadong. 00:32:38 (+)
题意：将字符串尽可能少的断开，使得断开的每部分都是其循环串种字典序最小的。
题解：考虑最多的断开情况，一定是 $1111\; 0111\; 0011\; 0001\; 0000$ 如此的。
也就是断开的一定是 $\sqrt{n}$ 级别的。
于是考虑贪心的做，从后往前枚举断点，用最小表示法判断合法性即可。
Problem B
Solved by Weaver_zhu && Kilo_5723. 01:09:39 (+)
Problem C
Solved by Xiejiadong. 03:49:18 (+5)
Problem D
Solved by Weaver_zhu. 00:03:13 (+)
Problem E
Solved by Kilo_5723. 04:48:49 (+)
Problem F
Unsolved.
Problem G
Unsolved.
Problem H
Unsolved. (-4)
Problem I
Solved by Kilo_5723. 03:13:21 (+)
Problem J
Solved by Xiejiadong. 00:06:51 (+)
Problem K
Unsolved.