UVA - 1608 Non-boring sequences
Non-boring sequencesWe were afraid of making this problem statement too boring, so we decided to keep it short. A sequence is called non-boring if its every connected subsequence contains a unique elem
原创
2017-07-27 20:58:54 ·
672 阅读 ·
0 评论