CF1136E Nastya Hasn't Written a Legend

In this task, Nastya asked us to write a formal statement. An array $ a $ of length $ n $ and an array $ k $ of length $ n-1 $ are given. Two types of queries should be processed: - increase $ a_i $ by $ x $ . Then if $ a_{i+1} < a_i + k_i $ , $ a_{i+1} $ becomes exactly $ a_i + k_i $ ; again, if $ a_{i+2} < a_{i+1} + k_{i+1} $ , $ a_{i+2} $ becomes exactly $ a_{i+1} + k_{i+1} $ , and so far for $ a_{i+3} $ , ..., $ a_n $ ; - print the sum of the contiguous subarray from the $ l $ -th element to the $ r $ -th element of the array $ a $ . It's guaranteed that initially $ a_i + k_i \leq a_{i+1} $ for all $ 1 \leq i \leq n-1 $ .

N/A

N/A

In the first example: - after the first change $ a = [3, 4, 3] $ ; - after the second change $ a = [3, 4, 4] $ . In the second example: - after the first change $ a = [6, 9, 10] $ ; - after the second change $ a = [6, 13, 14] $ .