We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
long int arr[n+1];
memset(arr,0,sizeof(arr));
long int m = queries.size();
long int max = 0;
long int sum = 0;
for(int i=0;i<m;i++)
{
long int a = queries[i][0];
long int b = queries[i][1];
long int k = queries[i][2];
arr[a-1] += k;
arr[b] -= k;
}
for(int x=0;x<n;x++)
{
sum += arr[x];
if(max < sum)
max = sum;
}
return max;
Addition needs to be done at a and subtraction at b+1.
Also,avoid memset on hackerrank sometimes it doesn't work fine.
Lastly,the final loop would run till <=n.
Array Manipulation
You are viewing a single comment's thread. Return to all comments →
can u guyz tell me whats wrong in my code?
long arrayManipulation(int n, vector> queries) {
}
Addition needs to be done at a and subtraction at b+1. Also,avoid memset on hackerrank sometimes it doesn't work fine. Lastly,the final loop would run till <=n.
actually this code works fine in 1st 3 test cases... and my code is for 0-indexed that is why I used a-1 and b does it wrong?