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.
  1. Prepare
  2. Algorithms
  3. Search
  4. Minimum Loss
  5. Discussions

Minimum Loss

  • Coder_AMiT
     + 34 comments

    This must be an easy problem actually. all you have to do is sort the array, and then check the difference of adjacent pairs, if its less than ur last min value, update it only if the index of those pairs are in same way in original array.

    n =  int(input().strip())
numbers = list(map(int,input().strip().split()))

nums = list(numbers)
nums.sort()
minCost = 10**10
for i in range(1,n):
    if (nums[i]-nums[i-1] < minCost)  and (numbers.index(nums[i]) < numbers.index(nums[i-1])):
        minCost = nums[i]-nums[i-1]
print(minCost)

    ''' Improved version using Hash.'''

n =  int(input().strip())
numbers = list(map(int,input().strip().split()))
myDict = {}
for i in range(n):
    myDict[numbers[i]]=i
minCost = 10**10
nums = sorted(myDict)
for i in range(1,n):
    if (nums[i]-nums[i-1] < minCost)  and (myDict[nums[i]] < myDict[nums[i-1]]):
        minCost = nums[i]-nums[i-1]
print(minCost)