Difference between revisions of "2018 ACM-ICPC Xuzhou Regional Onsite"
Jump to navigation
Jump to search
| Line 24: | Line 24: | ||
Solved by kblack. 03:05 (+2) | Solved by kblack. 03:05 (+2) | ||
| + | |||
| + | 题意：$n$ 个区间，$k$ 染色使得有 $k$ 种颜色的区间最长。 | ||
| + | |||
| + | 题解：扫描线，贪心，set 里扔缺的颜色和可用线段，每当颜色不够 $k$ 的时候才延迟区间染色。 | ||
== Problem M == | == Problem M == | ||
Solved by kblack & ultmaster. 02:17 (+1) | Solved by kblack & ultmaster. 02:17 (+1) | ||
Revision as of 07:42, 28 October 2018
Replay
Problem A
Solved by kblack. 00:50 (+3)
此处省略一万字。
Problem F
Unsolved. (-11)
T 飞了。
题意：求一个字符串 S 中的非空子串 T 的数量，满足不存在 TP 是 S 的子串且 TP 和 PT 完全一致。
题解（伪）：
Problem G
Solved by zerol. 01:14 (+)
Problem H
Solved by kblack. 03:05 (+2)
题意：$n$ 个区间，$k$ 染色使得有 $k$ 种颜色的区间最长。
题解：扫描线，贪心，set 里扔缺的颜色和可用线段，每当颜色不够 $k$ 的时候才延迟区间染色。
Problem M
Solved by kblack & ultmaster. 02:17 (+1)