> For the complete documentation index, see [llms.txt](https://gl01.gitbook.io/gfg-editorials/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://gl01.gitbook.io/gfg-editorials/2023/10-2023-oct-22/23-maximum-sum-increasing-subsequence.md).

# 23. Maximum sum increasing subsequence

The problem can be found at the following link: [Question Link](https://practice.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence4749/1)

![](https://badgen.net/badge/Level/Medium/yellow)

## My Approach

To find the maximum sum increasing subsequence, I use dynamic programming. I maintain a `dp` array of the same size as the input array `arr`. `dp[i]` represents the maximum sum of increasing subsequence ending with `arr[i]`.

To getting your Maximum Here is Bottom Up DP approach.

* I initialize `dp` with the values of `arr`.
* Then, I iterate through the elements of `arr`.
  * For each element, I iterate through the previous elements and check if they are smaller than the current element.
  * If yes, I update `dp[i]` to be the maximum between its current value and `dp[j] + arr[i]`, where `j` is the index of a smaller element.
* Finally, I find the maximum value in the `dp` array, which represents the maximum sum increasing subsequence.

## Time and Auxiliary Space Complexity

* **Time Complexity**: `O(n^2)`, where `n` is the size of the input array `arr`. This is because we have a nested loop.
* **Auxiliary Space Complexity**: `O(n)` for the `dp` array.

## Code (C++)

```cpp
class Solution {
public:
    int maxSumIS(int arr[], int n) {
        vector<int> dp(arr, arr + n);

        for (int i = 1; i < n; i++) {
            for (int j = 0; j < i; j++) {
                if (arr[j] < arr[i]) {
                    dp[i] = max(dp[i], dp[j] + arr[i]);
                }
            }
        }

        int out = 0;
        for (auto i : dp) {
            out = max(out, i);
        }
        return out;
    }
};
```

## Contribution and Support

For discussions, questions, or doubts related to this solution, please visit our [discussion section](https://github.com/getlost01/gfg-potd/discussions). We welcome your input and aim to foster a collaborative learning environment.

If you find this solution helpful, consider supporting us by giving a ⭐ star to the [getlost01/gfg-potd](https://github.com/getlost01/gfg-potd) repository.


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://gl01.gitbook.io/gfg-editorials/2023/10-2023-oct-22/23-maximum-sum-increasing-subsequence.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.