Sum of f(a[i], a[j]) over all pairs in an array of n integers
Last Updated :
12 Jul, 2022
Given an array of n integers, find the sum of f(a[i], a[j]) of all pairs (i, j) such that (1 <= i < j <= n).
f(a[i], a[j]):
If |a[j]-a[i]| > 1
f(a[i], a[j]) = a[j] - a[i]
Else // if |a[j]-a[i]| <= 1
f(a[i], a[j]) = 0
Examples:
Input : 6 6 4 4
Output : -8
Explanation:
All pairs are: (6 - 6) + (6 - 6) +
(6 - 6) + (4 - 6) + (4 - 6) + (4 - 6) +
(4 - 6) + (4 - 4) + (4 - 4) = -8
Input: 1 2 3 1 3
Output: 4
Explanation: the pairs that add up are:
(3, 1), (3, 1) to give 4, rest all pairs
according to condition gives 0.
A naive approach is to iterate through all pairs and calculate f(a[i], a[j]), and summing it up while traversing two nested loops will give us our answer.
Time Complexity: O(n^2)
An efficient approach would be to use a map/hash function to keep a count of every occurring number and then traverse through the list. While traversing through the list, we multiply the count of numbers that are before it and the number itself. Then subtract this result with the pre-sum of the number before that number to get the sum of the difference of all pairs possible with that number. To remove all pairs whose absolute difference is <=1, simply subtract the count of occurrence of (number-1) and (number+1) from the previously computed sum. Here we subtract the count of (number-1) from the computed sum as it had been previously added to the sum, and we add the (number+1) count since the negative has been added to the pre-computed sum of all pairs.
Time Complexity: O(n)
Below is the implementation of the above approach:
C++
// CPP program to calculate the
// sum of f(a[i], aj])
#include <bits/stdc++.h>
using namespace std;
// Function to calculate the sum
int sum(int a[], int n)
{
// map to keep a count of occurrences
unordered_map<int, int> cnt;
// Traverse in the list from start to end
// number of times a[i] can be in a pair and
// to get the difference we subtract pre_sum.
int ans = 0, pre_sum = 0;
for (int i = 0; i < n; i++) {
ans += (i * a[i]) - pre_sum;
pre_sum += a[i];
// if the (a[i]-1) is present then
// subtract that value as f(a[i], a[i]-1)=0
if (cnt[a[i] - 1])
ans -= cnt[a[i] - 1];
// if the (a[i]+1) is present then
// add that value as f(a[i], a[i]-1)=0
// here we add as a[i]-(a[i]-1)<0 which would
// have been added as negative sum, so we add
// to remove this pair from the sum value
if (cnt[a[i] + 1])
ans += cnt[a[i] + 1];
// keeping a counter for every element
cnt[a[i]]++;
}
return ans;
}
// Driver code
int main()
{
int a[] = { 1, 2, 3, 1, 3 };
int n = sizeof(a) / sizeof(a[0]);
cout << sum(a, n);
return 0;
}
// Java program to calculate
// the sum of f(a[i], aj])
import java.util.*;
public class GfG {
// Function to calculate the sum
public static int sum(int a[], int n)
{
// Map to keep a count of occurrences
Map<Integer,Integer> cnt = new HashMap<Integer,Integer>();
// Traverse in the list from start to end
// number of times a[i] can be in a pair and
// to get the difference we subtract pre_sum
int ans = 0, pre_sum = 0;
for (int i = 0; i < n; i++) {
ans += (i * a[i]) - pre_sum;
pre_sum += a[i];
// If the (a[i]-1) is present then subtract
// that value as f(a[i], a[i]-1) = 0
if (cnt.containsKey(a[i] - 1))
ans -= cnt.get(a[i] - 1);
// If the (a[i]+1) is present then
// add that value as f(a[i], a[i]-1)=0
// here we add as a[i]-(a[i]-1)<0 which would
// have been added as negative sum, so we add
// to remove this pair from the sum value
if (cnt.containsKey(a[i] + 1))
ans += cnt.get(a[i] + 1);
// keeping a counter for every element
if(cnt.containsKey(a[i])) {
cnt.put(a[i], cnt.get(a[i]) + 1);
}
else {
cnt.put(a[i], 1);
}
}
return ans;
}
// Driver code
public static void main(String args[])
{
int a[] = { 1, 2, 3, 1, 3 };
int n = a.length;
System.out.println(sum(a, n));
}
}
// This code is contributed by Swetank Modi
# Python3 program to calculate the
# sum of f(a[i], aj])
# Function to calculate the sum
def sum(a, n):
# map to keep a count of occurrences
cnt = dict()
# Traverse in the list from start to end
# number of times a[i] can be in a pair and
# to get the difference we subtract pre_sum.
ans = 0
pre_sum = 0
for i in range(n):
ans += (i * a[i]) - pre_sum
pre_sum += a[i]
# if the (a[i]-1) is present then
# subtract that value as f(a[i], a[i]-1)=0
if (a[i] - 1) in cnt:
ans -= cnt[a[i] - 1]
# if the (a[i]+1) is present then add that
# value as f(a[i], a[i]-1)=0 here we add
# as a[i]-(a[i]-1)<0 which would have been
# added as negative sum, so we add to remove
# this pair from the sum value
if (a[i] + 1) in cnt:
ans += cnt[a[i] + 1]
# keeping a counter for every element
if a[i] not in cnt:
cnt[a[i]] = 0
cnt[a[i]] += 1
return ans
# Driver Code
if __name__ == '__main__':
a = [1, 2, 3, 1, 3]
n = len(a)
print(sum(a, n))
# This code is contributed by
# SHUBHAMSINGH10
using System;
using System.Collections.Generic;
// C# program to calculate
// the sum of f(a[i], aj])
public class GfG
{
// Function to calculate the sum
public static int sum(int[] a, int n)
{
// Map to keep a count of occurrences
IDictionary<int, int> cnt = new Dictionary<int, int>();
// Traverse in the list from start to end
// number of times a[i] can be in a pair and
// to get the difference we subtract pre_sum
int ans = 0, pre_sum = 0;
for (int i = 0; i < n; i++)
{
ans += (i * a[i]) - pre_sum;
pre_sum += a[i];
// If the (a[i]-1) is present then subtract
// that value as f(a[i], a[i]-1) = 0
if (cnt.ContainsKey(a[i] - 1))
{
ans -= cnt[a[i] - 1];
}
// If the (a[i]+1) is present then
// add that value as f(a[i], a[i]-1)=0
// here we add as a[i]-(a[i]-1)<0 which would
// have been added as negative sum, so we add
// to remove this pair from the sum value
if (cnt.ContainsKey(a[i] + 1))
{
ans += cnt[a[i] + 1];
}
// keeping a counter for every element
if (cnt.ContainsKey(a[i]))
{
cnt[a[i]] = cnt[a[i]] + 1;
}
else
{
cnt[a[i]] = 1;
}
}
return ans;
}
// Driver code
public static void Main(string[] args)
{
int[] a = new int[] {1, 2, 3, 1, 3};
int n = a.Length;
Console.WriteLine(sum(a, n));
}
}
// This code is contributed by Shrikant13
<script>
// Javascript program to calculate the
// sum of f(a[i], aj])
// Function to calculate the sum
function sum(a, n)
{
// map to keep a count of occurrences
var cnt = new Map();
// Traverse in the list from start to end
// number of times a[i] can be in a pair and
// to get the difference we subtract pre_sum.
var ans = 0, pre_sum = 0;
for (var i = 0; i < n; i++) {
ans += (i * a[i]) - pre_sum;
pre_sum += a[i];
// if the (a[i]-1) is present then
// subtract that value as f(a[i], a[i]-1)=0
if (cnt.has(a[i] - 1))
ans -= cnt.get(a[i] - 1);
// if the (a[i]+1) is present then
// add that value as f(a[i], a[i]-1)=0
// here we add as a[i]-(a[i]-1)<0 which would
// have been added as negative sum, so we add
// to remove this pair from the sum value
if(cnt.has(a[i] + 1))
ans += cnt.get(a[i] + 1);
// keeping a counter for every element
if(cnt.has(a[i]))
cnt.set(a[i], cnt.get(a[i])+1)
else
cnt.set(a[i], 1)
}
return ans;
}
// Driver code
var a = [1, 2, 3, 1, 3];
var n = a.length;
document.write( sum(a, n));
</script>
Output:
4
Time Complexity: O(n)
Auxiliary Space: O(n)
Similar Reads
Sum of Bitwise OR of all pairs in a given array Given an array "arr[0..n-1]" of integers. The task is to calculate the sum of Bitwise OR of all pairs, i.e. calculate the sum of "arr[i] | arr[j]" for all the pairs in the given array where i < j. Here '|' is a bitwise OR operator. The expected time complexity is O(n). Examples: Input: arr[] = {5
13 min read
Sum of Bitwise And of all pairs in a given array Given an array "arr[0..n-1]" of integers, calculate sum of "arr[i] & arr[j]" for all the pairs in the given where i < j. Here & is bitwise AND operator. Expected time complexity is O(n). Examples : Input: arr[] = {5, 10, 15} Output: 15 Required Value = (5 & 10) + (5 & 15) + (10
13 min read
Sum of XOR of all pairs in an array Given an array of n integers, find the sum of xor of all pairs of numbers in the array. Examples : Input : arr[] = {7, 3, 5}Output : 127 ^ 3 = 43 ^ 5 = 67 ^ 5 = 2Sum = 4 + 6 + 2 = 12Input : arr[] = {5, 9, 7, 6}Output : 475 ^ 9 = 129 ^ 7 = 147 ^ 6 = 15 ^ 7 = 25 ^ 6 = 39 ^ 6 = 15Sum = 12 + 14 + 1 + 2
11 min read
Check if sum of arr[i] / j for all possible pairs (i, j) in an array is 0 or not Given an array arr[] consisting of N integers, the task is to check if the sum of all possible values of (arr[i] / j) for all pairs (i, j) such that 0 < i ? j < (N - 1) is 0 or not. If found to be true, then print "Yes". Otherwise, print "No". Examples: Input: arr[] = {1, -1, 3, -2, -1}Output:
5 min read
Sum of product of all pairs of a Binary Array Given a binary array arr[] of size N, the task is to print the sum of product of all pairs of the given array elements. Note: The binary array contains only 0 and 1. Examples: Input: arr[] = {0, 1, 1, 0, 1}Output: 3Explanation: Sum of product of all possible pairs are: {0 × 1 + 0 × 1 + 0 × 0 + 0 × 1
5 min read