Hello sir why this is giving error please help me in this

#1

question link:
https://hack.codingblocks.com/app/practice/3/715/problem

my code link:

please give me suggestion or rectify my mistake

#2

hello @dhruvilcodes

ur solution complexity is O(N^2) per test case.
image

which is too much for the given values of n.

try to think of O(NLOGN) approach .

#3 
for(i=0;i<n;i++)
{
	for(j=i+1;j<n;j++)
	{
		if(i!=j)
		{
			sum+=abs(a[i]-a[j])*max(b[i],b[j]);
		}
	}
}

I CHANGED TO THIS STILL I AM NOT GETTING RID OF TLE

#4

it is still N^2.

are u familiar with Binary indexed tree?
if yes then try to think in that direction.

#5

N O SIR EVEN I DO NOT KNOW ABOUT THIS COMPLEXITY THING

#6

ok then leave this problem for now.
learn other rquired stuff and then try it again

1 Like