The judge gives TLE with this method

[code026 (Arjit Arora)]

max-Query1Problem

I dont know what’s causing the TLE. Can anyone please help #include<iostream> #include<vector> #include<climits> typedef long long ll; #define pb push_back using namespace std; ll a[200000]; void buildTree(ll s, ll e,ll *tree,ll index){ if(s==e) { tree[index] = a[s]; return; } ll mid = (s+e)/2; //build child trees buildTree(s,mid,tree,2*index); buildTree(mid+1,e,tree,2*index+1); //min of both children tree[index] = min(tree[2*index],tree[2*index+1]); return; } ll query(ll …

Please look into it,
Sorry for the last post , i’m unfamiliar with this section

[tusharsk (Tushar Kumar)]

Hi

Please share link of your code after pasting it on ide (https://ide.codingblocks.com/)

[tusharsk (Tushar Kumar)]

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.

[code026 (Arjit Arora)]

Coding Blocks IDE

[tusharsk (Tushar Kumar)]

Hi

your logic is wrong

tree[index] contain minimum number in range s and e for which tree[index] is defined.

pm me on or anubhav aron we’ll explain you the approach and your mistake.