Help on array

CodeChefOpen on judge ↗

Rahul has another problem to solve, he is given an array A now he has to increase its every element by its own index(1 - based). Then he has to find the sum of the maximum elements of the resultant array in every possible sub-array. As the answer can be large, output it modulo 10^9 + 7. Help him.... Flawed code #include #define Ull long long using namespace std; Ull mod=1e9+7; int main(

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI