You start with an array containing all zeroes. You will be given some updates. Updates are in the form $$$L, R, A, B$$$. For each update, you have to add $$$A+(i-L)*B$$$ for each $$$L \leq i \leq R$$$. You will have to answer queries in the form $$$L, R$$$. For each query, you have answer what's the maximum element in $$$[L, R]$$$ range.
The range sum query version of this problem can be solved with segment tree with lazy propagation. However, I can't think of a way to solve this one.
There will be a contest for the freshmen of CSE department, BUET. We will be hosting a replay of the contest on CodeChef on 9 PM BST (3 PM UTC). It is an open contest. Anyone can participate in the contest. The contest duration is 3 hours. Here's the contest link: https://www.codechef.com/BCRR2018
The problems would be rather observation and implementation based than algorithmic nature. So, you don't need to know complex classical algorithms to do better in the contest!