2019年8月12日
CodeForces - 1196B. Odd Sum Segments(思维/基础数论)
摘要： You are given an array a consisting of n integers a1,a2,…,an. You want to split it into exactly k non-empty non-intersecting subsegments such that eac 阅读全文
posted @ 2019-08-12 11:02 YuKi_hahaha 阅读(328) 评论(0) 推荐(1)