Skip to content
Related Articles

Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

Maximum sub-sequence sum such that indices of any two adjacent elements differs at least by 3

  • Difficulty Level : Expert
  • Last Updated : 11 May, 2021

Given an array arr[] of integers, the task is to find the maximum sum of any sub-sequence in the array such that any two adjacent elements in the selected sequence have at least a difference of 3 in their indices in the given array. 
In other words, if you select arr[i] then the next element you can select is arr[i + 3], arr[i + 4], and so on… but you cannot select arr[i + 1] and arr[i + 2].
Examples: 
 

Input: arr[] = {1, 2, -2, 4, 3} 
Output: 5 
{1, 4} and {2, 3} are the only sub-sequences 
with maximum sum.
Input: arr[] = {1, 2, 72, 4, 3, 9} 
Output: 81 
 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

 



Naive approach: We generate all possible subsets of the array and check if the current subset satisfies the condition.If yes, then we compare its sum with the largest sum we have obtained till now.It is not an efficient approach as it takes exponential time .
Efficient approach: This problem can be solved using dynamic programming. Let’s decide the states of the dp. Let dp[i] be the largest possible sum for the sub-sequence staring from index 0 and ending at index i. Now, we have to find a recurrence relation between this state and a lower-order state. 
In this case for an index i, we will have two choices: 
 

  1. Choose the current index: In this case, the relation will be dp[i] = arr[i] + dp[i – 3].
  2. Skip the current index: Relation will be dp[i] = dp[i – 1].

We will choose the path that maximizes our result. Thus the final relation will be: 
dp[i] = max(dp[i – 3] + arr[i], dp[i – 1])
Below is the implementation of the above approach: 
 

C++




// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to return the maximum sum
// of the sub-sequence such that two
// consecutive elements have a difference of
// at least 3 in their indices
// in the given array
int max_sum(int a[], int n)
{
 
    int dp[n];
 
    // If there is a single element in the array
    if (n == 1) {
 
        // Either select it or don't
        dp[0] = max(0, a[0]);
    }
 
    // If there are two elements
    else if (n == 2) {
 
        // Either select the first
        // element or don't
        dp[0] = max(0, a[0]);
 
        // Either select the first or the second element
        // or don't select any element
        dp[1] = max(a[1], dp[0]);
    }
    else if (n >= 3) {
 
        // Either select the first
        // element or don't
        dp[0] = max(0, a[0]);
 
        // Either select the first or the second element
        // or don't select any element
        dp[1] = max(a[1], max(0, a[0]));
 
        // Either select first, second, third or nothing
        dp[2] = max(a[2], max(a[1], max(0, a[0])));
 
        int i = 3;
 
        // For the rest of the elements
        while (i < n) {
 
            // Either select the best sum till
            // previous_index or select the current
            // element + best_sum till index-3
            dp[i] = max(dp[i - 1], a[i] + dp[i - 3]);
            i++;
        }
    }
 
    return dp[n - 1];
}
 
// Driver code
int main()
{
    int arr[] = { 1, 2, -2, 4, 3 };
    int n = sizeof(arr) / sizeof(arr[0]);
 
    cout << max_sum(arr, n);
 
    return 0;
}
Java



// Java implementation of the approach
class GFG
{
 
// Function to return the maximum sum
// of the sub-sequence such that two
// consecutive elements have a difference of
// at least 3 in their indices
// in the given array
static int max_sum(int a[], int n)
{
 
    int []dp = new int[n];
 
    // If there is a single element in the array
    if (n == 1)
    {
 
        // Either select it or don't
        dp[0] = Math.max(0, a[0]);
    }
 
    // If there are two elements
    else if (n == 2)
    {
 
        // Either select the first
        // element or don't
        dp[0] = Math.max(0, a[0]);
 
        // Either select the first or the second element
        // or don't select any element
        dp[1] = Math.max(a[1], dp[0]);
    }
    else if (n >= 3)
    {
 
        // Either select the first
        // element or don't
        dp[0] = Math.max(0, a[0]);
 
        // Either select the first or the second element
        // or don't select any element
        dp[1] = Math.max(a[1], Math.max(0, a[0]));
 
        // Either select first, second, third or nothing
        dp[2] = Math.max(a[2], Math.max(a[1], Math.max(0, a[0])));
 
        int i = 3;
 
        // For the rest of the elements
        while (i < n)
        {
 
            // Either select the best sum till
            // previous_index or select the current
            // element + best_sum till index-3
            dp[i] = Math.max(dp[i - 1], a[i] + dp[i - 3]);
            i++;
        }
    }
 
    return dp[n - 1];
}
 
// Driver code
public static void main(String[] args)
{
    int arr[] = { 1, 2, -2, 4, 3 };
    int n = arr.length;
 
    System.out.println(max_sum(arr, n));
}
}
 
// This code is contributed by Rajput-Ji
Python3



# Python3 implementation of the approach
 
# Function to return the maximum sum
# of the sub-sequence such that two
# consecutive elements have a difference of
# at least 3 in their indices
# in the given array
def max_sum(a, n) :
 
    dp = [0]*n;
 
    # If there is a single element in the array
    if (n == 1) :
 
        # Either select it or don't
        dp[0] = max(0, a[0]);
 
    # If there are two elements
    elif (n == 2) :
 
        # Either select the first
        # element or don't
        dp[0] = max(0, a[0]);
 
        # Either select the first or the second element
        # or don't select any element
        dp[1] = max(a[1], dp[0]);
         
    elif (n >= 3) :
 
        # Either select the first
        # element or don't
        dp[0] = max(0, a[0]);
 
        # Either select the first or the second element
        # or don't select any element
        dp[1] = max(a[1], max(0, a[0]));
 
        # Either select first, second, third or nothing
        dp[2] = max(a[2], max(a[1], max(0, a[0])));
 
        i = 3;
 
        # For the rest of the elements
        while (i < n) :
 
            # Either select the best sum till
            # previous_index or select the current
            # element + best_sum till index-3
            dp[i] = max(dp[i - 1], a[i] + dp[i - 3]);
            i += 1;
 
    return dp[n - 1];
 
 
# Driver code
if __name__ == "__main__" :
 
    arr = [ 1, 2, -2, 4, 3 ];
    n = len(arr);
 
    print(max_sum(arr, n));
 
# This code is contributed by AnkitRai01
C#



// C# implementation of the approach
using System;
 
class GFG
{
     
// Function to return the maximum sum
// of the sub-sequence such that two
// consecutive elements have a difference of
// at least 3 in their indices
// in the given array
static int max_sum(int []a, int n)
{
 
    int []dp = new int[n];
 
    // If there is a single element in the array
    if (n == 1)
    {
 
        // Either select it or don't
        dp[0] = Math.Max(0, a[0]);
    }
 
    // If there are two elements
    else if (n == 2)
    {
 
        // Either select the first
        // element or don't
        dp[0] = Math.Max(0, a[0]);
 
        // Either select the first or the second element
        // or don't select any element
        dp[1] = Math.Max(a[1], dp[0]);
    }
    else if (n >= 3)
    {
 
        // Either select the first
        // element or don't
        dp[0] = Math.Max(0, a[0]);
 
        // Either select the first or the second element
        // or don't select any element
        dp[1] = Math.Max(a[1], Math.Max(0, a[0]));
 
        // Either select first, second, third or nothing
        dp[2] = Math.Max(a[2], Math.Max(a[1], Math.Max(0, a[0])));
 
        int i = 3;
 
        // For the rest of the elements
        while (i < n)
        {
 
            // Either select the best sum till
            // previous_index or select the current
            // element + best_sum till index-3
            dp[i] = Math.Max(dp[i - 1], a[i] + dp[i - 3]);
            i++;
        }
    }
 
    return dp[n - 1];
}
 
// Driver code
static public void Main ()
{
         
    int []arr = { 1, 2, -2, 4, 3 };
    int n = arr.Length;
 
    Console.Write(max_sum(arr, n));
}
}
 
// This code is contributed by ajit..
Javascript



<script>
    // Javascript implementation of the approach
     
    // Function to return the maximum sum
    // of the sub-sequence such that two
    // consecutive elements have a difference of
    // at least 3 in their indices
    // in the given array
    function max_sum(a, n)
    {
 
        let dp = new Array(n);
 
        // If there is a single element in the array
        if (n == 1)
        {
 
            // Either select it or don't
            dp[0] = Math.max(0, a[0]);
        }
 
        // If there are two elements
        else if (n == 2)
        {
 
            // Either select the first
            // element or don't
            dp[0] = Math.max(0, a[0]);
 
            // Either select the first or the second element
            // or don't select any element
            dp[1] = Math.max(a[1], dp[0]);
        }
        else if (n >= 3)
        {
 
            // Either select the first
            // element or don't
            dp[0] = Math.max(0, a[0]);
 
            // Either select the first or the second element
            // or don't select any element
            dp[1] = Math.max(a[1], Math.max(0, a[0]));
 
            // Either select first, second, third or nothing
            dp[2] = Math.max(a[2], Math.max(a[1], Math.max(0, a[0])));
 
            let i = 3;
 
            // For the rest of the elements
            while (i < n)
            {
 
                // Either select the best sum till
                // previous_index or select the current
                // element + best_sum till index-3
                dp[i] = Math.max(dp[i - 1], a[i] + dp[i - 3]);
                i++;
            }
        }
 
        return dp[n - 1];
    }
     
    let arr = [ 1, 2, -2, 4, 3 ];
    let n = arr.length;
   
    document.write(max_sum(arr, n));
 
</script>
Output: 
5
 
Time Complexity: O(N) 
Auxiliary Space: O(N)
 



My Personal Notes
arrow_drop_up
Previous
Check if given string can be formed by two other strings or their permutations
Next

Remove first adjacent pairs of similar characters until possible
Recommended Articles
Page :
Count pairs of indices having sum of indices same as the sum of elements at those indices
21, Jul 21
Count of indices pairs such that product of elements at these indices is equal to absolute difference of indices
07, Jul 21
Count of unordered pair of indices such that ratio of elements at these indices is same as ratio of indices
24, Aug 21
Maximum length subsequence such that adjacent elements in the subsequence have a common factor
11, Feb 19
Count maximum occurrence of subsequence in string such that indices in subsequence is in A.P.
09, Apr 20
Longest subsequence such that adjacent elements have at least one common digit
25, Feb 19
Find the Array Permutation having sum of elements at odd indices greater than sum of elements at even indices
07, Jul 21
Longest increasing subsequence consisting of elements from indices divisible by previously selected indices
04, Dec 20
Count of index subsets such that maximum of values over these indices in A is at least total sum over B
20, Sep 21
Rearrange sorted array such that all odd indices elements comes before all even indices element
09, Sep 21
Count of 0s to be flipped to make any two adjacent 1s at least K 0s apart
03, Jul 20
Minimum sum subsequence such that at least one of every four consecutive elements is picked
02, Jan 17
Generate a string which differs by only a single character from all given strings
24, Aug 20
Length of the longest increasing subsequence such that no two adjacent elements are coprime
03, Apr 19
Maximum sum subsequence with at-least k distant elements
31, Oct 17
Smallest number that can replace all -1s in an array such that maximum absolute difference between any pair of adjacent elements is minimum
28, Jun 21
Maximum sum such that no two elements are adjacent
26, Nov 09
Maximum sum in a 2 x n grid such that no two elements are adjacent
08, Jun 17
Maximum sum in circular array such that no two elements are adjacent
21, Aug 18
Maximum sum such that no two elements are adjacent | Set 2
14, May 19
Maximum sum such that exactly half of the elements are selected and no two adjacent
27, Apr 20
Maximum sum in circular array such that no two elements are adjacent | Set 2
08, May 20
Maximum subsequence sum with adjacent elements having atleast K difference in index
07, Feb 20
Cost of creating smallest subsequence with sum of difference between adjacent elements maximum
08, Jul 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
KaranGujar1
@KaranGujar1
Vote for difficulty
Current difficulty :
Expert





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox