Wrong answer : https://ide.codingblocks.com/s/170690

ria_jhaX5P · January 24, 2020, 5:13am

I tried to modify the query part accordingly so that for every node it will check whether the value is less than the maximum value in that range if yes then continue till the last node otherwise return 0.

Robin_rst · January 30, 2020, 9:32pm

At every node you have to store the sorted part of elements of that range, and then when you meet a range ,just do binary search and return the answer.

For better understanding , refer this -:

github.com

robinrst/HackerBlocks/blob/master/MaxQuery1.cpp

#include        "algorithm"
#include        "iostream"
#include        "numeric"
#include        "iomanip"
#include        "cstring"
#include        "math.h"
#include        "bitset"
#include        "string"
#include        "vector"
#include        "ctime"
#include        "queue"
#include        "stack"
#include        "map"
#include        "set"

#include        "ext/pb_ds/assoc_container.hpp" // Common file
#include        "ext/pb_ds/tree_policy.hpp" // Including tree_order_statistics_node_update
#include        "ext/pb_ds/detail/standard_policies.hpp"

using namespace std;

This file has been truncated. show original

Robin_rst · February 6, 2020, 4:24pm

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.