摘要: Day 1 AcWing 2041. 干草堆 简单的前缀和,加上一点点读入优化 int main() { n = read() , k = read(); for( int i = 1 , l , r ; i <= k ; i ++ ) { l = read() , r = read(); a[ l 阅读全文
posted @ 2022-01-16 20:38 PHarr 阅读(39) 评论(0) 推荐(0) 编辑