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.
Fi
原创
2017-08-03 14:30:46 ·
275 阅读 ·
0 评论