Minus
Full text and comments »
Problem
Given an array of integers A and k queries. Each query will be like that: 1.Reverse an segment from l to r. 2.Output the sum of integers from l to r. N<=10^5,k<=10^4. Can this problem solved by using segment trees. How?
Given an array of integers A and k queries. Each query will be like that:
1.Reverse an segment from l to r.
2.Output the sum of integers from l to r.
N<=10^5,k<=10^4.
Can this problem solved by using segment trees. How?
AMA: TheOneYouWant
Atcoder ABC #351 Short Solution Discussion