Difference between revisions of "2019 Multi-University,Nowcoder Day 3"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
Xiejiadong (talk | contribs) |
||
| Line 6: | Line 6: | ||
Solved by Xiejiadong. 00:19:55 (+) | Solved by Xiejiadong. 00:19:55 (+) | ||
| + | |||
| + | 题意：求 $0/1$ 数列中包含 $0/1$ 数量相等的最长子串和子序列。 | ||
| + | |||
| + | 题意：子序列，显然就是尽可能多得找 $0/1$ ，那么答案就是 $0/1$ 数量 min 的两倍。 | ||
| + | |||
| + | 对于子串，如果一个子串的 $0/1$ 数量相等的话，那么他们前缀和相等，前缀和以后，处理相同数的最远位置就好了。 | ||
== Problem C == | == Problem C == | ||
Revision as of 13:30, 25 July 2019
Problem A
Unsolved.
Problem B
Solved by Xiejiadong. 00:19:55 (+)
题意：求 $0/1$ 数列中包含 $0/1$ 数量相等的最长子串和子序列。
题意：子序列，显然就是尽可能多得找 $0/1$ ，那么答案就是 $0/1$ 数量 min 的两倍。
对于子串，如果一个子串的 $0/1$ 数量相等的话，那么他们前缀和相等，前缀和以后，处理相同数的最远位置就好了。
Problem C
Unsolved.
Problem D
Unsolved. (-6)
Problem E
Unsolved.
Problem F
Unsolved. (-10)
Problem G
Unsolved.
Problem H
Solved by Kilo_5723. 00:11:52 (+)
Problem I
Unsolved.
Problem J
Solved by Weaver_zhu. 01:18:37 (+3)