- 博客(2)
- 收藏
- 关注
原创 Codeforces 616D Longest k-Good Segment(双指针)
The array a with n integers is given. Let's call the sequence of one or more consecutive elements in a segment. Also let's call the segment k-good if it contains no more than k different values.
2016-01-17 21:56:07 1129
原创 CF 616C The Labyrinth(dfs)
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call
2016-01-14 12:50:07 910
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人