2019年7月13日
Nastya Hasn't Written a Legend（Codeforces Round #546 (Div. 2)E+线段树）
摘要： 题目链接 "传送门" 题面 题意 给你一个$a$数组和一个$k$数组，进行$q$次操作，操作分为两种： 将$a_i$增加$x$，此时如果$a_{i+1} include include include include include include include include include i 阅读全文
posted @ 2019-07-13 17:09 Dillonh 阅读(234) 评论(0) 推荐(0) 编辑