question->https://www.spoj.com/problems/AMR10G/
my code->https://ideone.com/IiDwWu
i am getting WA on spoj
Asked by: Avinash_Kumar on April 7, 2019, 6:34 p.m. Last updated on April 7, 2019, 6:34 p.m.
for this testcase
5 3
1 4 5 6 10
your code o/p : 4
correct o/p : 2
you need to check the difference between the max and min elements by taking every possible window of size k.
change this :
for(i=0;i<a;i= i+b-1)
{ if(i+b-1<a)
{
k=ar[i+b-1]-ar[i];
c=min(k,c);
}
}
to : for(i=0;i<a;i++)
{ if(i+b-1<a)
{
k=ar[i+b-1]-ar[i];
c=min(k,c);
}
}
a small tip : you can use the sort() function in stl to sort an array. It's worst case time complexity is O(nlog(n)) ,while that of quicksort is O(n^2).